Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems

Authors:
Sándor P. Fekete;Henk Meijer;André Rohe;Walter Tietze
Affiliations:
-;-;-;-
Venue:
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Year:
2001

Citing 10
Cited 0

The algebraic degree of geometric optimization problems

Discrete & Computational Geometry
Geometry helps in matching

SIAM Journal on Computing
Optimizing over the subtour polytope of the travelling salesman problem

Mathematical Programming: Series A and B
A maximum b-matching problem arising from median location models with applications to the roommates problem

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

SIAM Journal on Computing
Simplicity and hardness of the maximum traveling salesman problem under geometric distances

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Computing Minimum-Weight Perfect Matchings

INFORMS Journal on Computing
A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane

FOCS '98 Proceedings of the 39th 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider geometric instances of the Maximum Weighted Matching Problem (MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000 vertices. Making use of a geometric duality relationship between MWMP, MTSP, and the Fermat-Weber-Problem (FWP), we develop a heuristic approach that yields in near-linear time solutions as well as upper bounds. Using various computational tools, we get solutions within considerably less than 1% of the optimum. An interesting feature of our approach is that, even though an FWP is hard to compute in theory and Edmonds' algorithm for maximum weighted matching yields a polynomial solution for the MWMP, the practical behavior is just the opposite, and we can solve the FWP with high accuracy in order to find a good heuristic solution for the MWMP.