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

@article{Arora1998PolynomialTA,
  title={Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems},
  author={Sanjeev Arora},
  journal={J. ACM},
  year={1998},
  volume={45},
  pages={753-782}
}
  • Sanjeev Arora
  • Published 1 September 1998
  • Mathematics, Computer Science
  • J. ACM
We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed <italic>c</italic> > 1 and given any <italic>n</italic> nodes in <inline-equation><f><sc>R</sc></f> </inline-equation><supscrpt>2</supscrpt>, a randomized version of the scheme finds a (1 + 1/<italic>c</italic>)-approximation to the optimum traveling salesman tour in <italic>O(n</italic>(log <italic>n</italic>)<supscrpt><italic>O(c)</italic>)</supscrpt> time. When the nodes are in <inline… 
The geometric maximum traveling salesman problem
TLDR
It is shown that for any polyhedral norm, the problem of finding a tour of the maximum length can be solved in polynomial time, and it is proved that, for the case of Euclidean distances in &##x211D;<sup><i>d</i></sup> for <i*d> ≥ 3, the Maximum TSP is NP-hard.
Approximation algorithms for a facility location problem with service capacities
TLDR
The first constant-factor approximation algorithms for the VLSI design problem, which generalizes the bin-packing problem and the Steiner tree problem, and has the additional feature of upper bounds on the service cost that each facility can handle.
Euclidean bounded-degree spanning tree ratios
TLDR
This work obtains better approximation algorithms for Euclidean minimum bounded-degree spanning trees by improving the upper bounds of the worst-case ratio in d-dimensional space.
Approximate distance oracles for geometric spanners
TLDR
The main result is a data structure that answers (1 + ϵ)-approximate shortest-path-length queries in constant time, and hence functions as an approximate distance oracle.
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?
TLDR
Computational experiments suggest that in terms of the time-quality trade-off, the minimum-weight double-tree shortcutting method provides one of the best existing tour-constructing heuristics.
Linear-time approximation schemes for clustering problems in any dimensions
TLDR
This work presents a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions and leads to simple randomized algorithms for the k-means, median and discrete problems.
On the Optimality of Planar and Geometric Approximation Schemes
  • D. Marx
  • Mathematics, Computer Science
    48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
  • 2007
TLDR
For several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on epsi, it is shown that if there is a delta 0 such that any of these problems admits a 2-delta O(1/epsi), then ETH fails.
Improved lower and upper bounds for universal TSP in planar metrics
TLDR
This paper settles the conjecture that there exists a constant-competitive universal TSP tour of finite metrics based on the spacefilling curve heuristic by proving an Ω (6√log <i>n</i>/log log <i+i>) lower bound for universal T SP tours of the n- ×-n grid.
The orienteering problem in the plane revisited
TLDR
This work presents the first polynomial time approximation scheme (PTAS) for the orienteering problem, and visits at least (1−ε) k<i>k</i><sub>opt</sub> points of <i>P</i>, where k is the number of points visited by the optimal solution.
Fast hamiltonicity checking via bases of perfect matchings
TLDR
The fast basis change algorithm from the second result is used to present a Monte Carlo algorithm that given an undirected graph on n vertices along with a path decomposition of width at most pw decides Hamiltonicity in (2+√2) pw n O(1) time unless the Strong Exponential Time Hypothesis fails.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 106 REFERENCES
Geometry helps in matching
A set of 2<italic>n</italic> points on the plane induces a complete weighted undirected graph as follows: The points are the vertices of the graph and the weight of an edge between any two points is
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
  • Sanjeev Arora
  • Mathematics, Computer Science
    Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
TLDR
A polynomial time approximation scheme for Euclidean TSP in /spl Rfr//sup 2/ that finds a (1+/spl epsiv/)-approximation to the optimum traveling salesman tour in time n/sup 0(1//spl ePSiv/)/.
When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract)
TLDR
It is proved that the Traveling Salesperson Problem (MIN TSP) and the Minimum Steiner Tree problem (MIN ST) are Max SNP-hard (and thus NP-hard to approximate within some constant r > 1) even if all cities lie in the geometric space Rn.
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity
TLDR
It is observed that the time cost of the derandomization of the PTA schemes for Euclidean optimization problems in ℝd derived by Arora can be decreased by a multiplicative factor of Ω(n d−1 ).
Approximation algorithms for geometric tour and network design problems (extended abstract)
TLDR
An O(log m) approximation bound algorithm is provided for RBSP, where m < n is the minimum number of sides.
Faster Geometric K-point MST Approximation
  • D. Eppstein
  • Computer Science, Mathematics
    Comput. Geom.
  • 1997
Abstract We give fast new approximation algorithms for the problem of choosing k planar points out of n to minimize the length of their minimum spanning tree (equivalently, of their traveling
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
TLDR
An algorithm is presented which finds for any 0 < e < 1 an approximate solution P satisfying (P* P)/P* < ~, where P* is the desired optimal sum.
Computer solutions of the traveling salesman problem
Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer. The first produces guaranteed optimal solution for problems
Fast Algorithms for Geometric Traveling Salesman Problems
TLDR
Efficient algorithms for computing approximate traveling salesman tours in multidimensional point sets and three local optimizations are described, which are able to solve uniform planar million-city traveling salesman problems to within a few percent of optimal in several midicomputer CPU hours.
Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k
TLDR
A polynomial time approximation scheme (PTAS) for this problem whose running time is (k/~)Oikf’sl + O(n log n) and which improves over the previous best known scheme.
...
1
2
3
4
5
...