Paper

The geometric maximum traveling salesman problem

2003

Created by Alysson Bolognesi Prado at 2019-03-28 10:15:26.0.

Simplified Graph of Associations

Word Cloud

Bibliographic Sets

1

Research Paradigm

Authors

6

David S. Johnson

Alexander Barvinok

Sándor P. Fekete

Gerhard J. Woeginger

Venue

1

Journal of the ACM

References

25

Linear time algorithm for the Hitchcock transportation problem with a fixed number of supply points

Linear time algorithms for some separable quadratic programming problems

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

The Euclidean traveling salesman problem is NP-complete

The Traveling Salesman Problem with Distances One and Two

Russian). Upravlyaemye Sistemy 27, 79--87