An efficient polynomial-time approximation scheme for Steiner forest in planar graphs

Details An efficient polynomial-time approximation scheme for Steiner forest in planar graphs An efficient polynomial-time approximation scheme for Steiner forest in planar graphs

2011-10-06

arxiv.org/abs/1110.1320v2

Computer Science

Data Structures and Algorithms

added material on balanced branch decompositions; fixed theorem references

Scientific paper

We give an $O(n \log^3 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.

Affiliated with

Also associated with

No associations

Rating

An efficient polynomial-time approximation scheme for Steiner forest in planar graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An efficient polynomial-time approximation scheme for Steiner forest in planar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An efficient polynomial-time approximation scheme for Steiner forest in planar graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-181940