2000 character limit reached
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
Published 6 Oct 2011 in cs.DS | (1110.1320v2)
Abstract: We give an $O(n \log3 n)$ approximation scheme for Steiner forest in planar graphs, improving on the previous approximation scheme for this problem, which runs in $O(n{f(\epsilon)})$ time.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.