Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
Proceedings of the forty-second ACM symposium on Theory of computing
Faster approximation schemes and parameterized algorithms on H-minor-free and odd-minor-free graphs
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
Exact distance oracles for planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A polynomial-time approximation scheme for planar multiway cut
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
Theoretical Computer Science
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Catalan structures and dynamic programming in H-minor-free graphs
Journal of Computer and System Sciences
A linear time approximation scheme for computing geometric maximum k-star
Journal of Global Optimization
| Hi-index | 0.00 |
We give an algorithm requiring $O(c^{1/\epsilon^2}n)$ time to find an $\epsilon$-optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edge-lengths. For the case of all lengths equal to 1, the time required is $O(c^{1/\epsilon} n)$.