Towards a syntactic characterization of PTAS
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
A polynomial-time approximation scheme for weighted planar graph TSP
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Light spanners and approximate TSP in weighted graphs with forbidden minors
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive on-line coverage of grid environments by a mobile robot
Computational Geometry: Theory and Applications
Approximate TSP in Graphs with Forbidden Minors
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Approximation Algorithms for Minimum Size 2-Connectivity Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A linear-time approximation scheme for planar weighted TSP
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved lower and upper bounds for universal TSP in planar metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A subset spanner for Planar graphs,: with application to subset TSP
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximation algorithms via contraction decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
The complexity of the Hajós calculus for planar graphs
Theoretical Computer Science
Traveling salesman problem of segments
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry
Contraction decomposition in h-minor-free graphs and algorithmic applications
Proceedings of the forty-third annual ACM symposium on Theory of computing
TSP on cubic and subcubic graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Dealing with large hidden constants: engineering a planar steiner tree PTAS
Journal of Experimental Algorithmics (JEA)
Interpolating an unorganized 2D point cloud with a single closed shape
Computer-Aided Design
Exploring simple grid polygons
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The asymmetric traveling salesman problem on graphs with bounded genus
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An improved strategy for exploring a grid polygon
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
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-time approximation scheme (PTAS) for this problem.