The traveling salesman problem with distances one and two
Mathematics of Operations Research
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth 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
Approximate TSP in Graphs with Forbidden Minors
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An approximation scheme for planar graph TSP
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
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
Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
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
A polynomial-time approximation scheme for Steiner tree in planar graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Catalan structures and dynamic programming in H-minor-free graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating TSP on metrics with bounded global growth
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
Computational Geometry: Theory and Applications
An approximation algorithm for a bottleneck traveling salesman problem
Journal of Discrete Algorithms
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
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
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry
Decomposition, approximation, and coloring of odd-minor-free graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Paired approximation problems and incompatible inapproximabilities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Dealing with large hidden constants: engineering a planar steiner tree PTAS
Journal of Experimental Algorithmics (JEA)
An efficient polynomial-time approximation scheme for Steiner forest in 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
Spanning closed walks and TSP in 3-connected planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The asymmetric traveling salesman problem on graphs with bounded genus
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Light spanners in bounded pathwidth graphs
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Minimum weight 2-edge-connected spanning subgraphs in planar graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We give an algorithm requiring O(c^{1/ \in ^2 }) time to find an \in -optimal traveling salesman tour in the metric defined by a planar graph with nonnegative edge-lengths.