Concepedia

Approximation algorithms for the TSP with sharpened triangle inequality

Hans-Joachim Böckenhauer, Juraj Hromkovič, Ralf Klasing, Sebastian Seibert, Walter Unger

Information Processing Letters · 2000 · 64 citations · 6 references

DOI

Concepts

References

6

Approximation Algorithms for NP-Hard Problems

Dorit S. Hochba · ACM SIGACT News · 1997 · 3.1K citations · Full text

, , +13

Complexity and approximation: Combinatorial optimization problems and their approximability properties

Computers & Mathematics with Applications · 2000 · 1.3K citations

, , +13

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

Sanjeev Arora · Journal of the ACM · 1998 · 1.1K citations · Full text

, , +17

The Traveling Salesman Problem with Distances One and Two

Christos H. Papadimitriou, Mihalis Yannakakis · Mathematics of Operations Research · 1993 · 417 citations

, , +12

Faster scaling algorithms for general graph matching problems

Harold N. Gabow, Robert E. Tarjan · Journal of the ACM · 1991 · 306 citations · Full text

, , +6