Paper

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

1998

Created by Alysson Bolognesi Prado at 2019-03-28 09:56:00.0.
Last updated by ACM worker at 2019-04-12 14:18:13.0.

Simplified Graph of Associations

Word Cloud

Bibliographic Sets

1

Research Paradigm

Authors

1

Venue

1

Journal of the ACM

References

53

Euclidean TSP is NP-complete

Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems

a simple new method for the geometric k-MST problem, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p

On the problem of Steiner

Approximation algorithms for geometric tour and network design problems (extended abstract)

An effective heuristic algorithm for the traveling salesman problem

Referenced By

3

Bypassing the embedding

The geometric maximum traveling salesman problem

A near-linear time ?-approximation algorithm for geometric bipartite matching