29 search results - page 1 / 6 » An Approximation Scheme for Planar Graph TSP |
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...
SIAMCOMP
2008
13 years 7 months ago
2008
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
SODA
1998
ACM
13 years 8 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...