Solving a "Hard" problem to approximate an "Easy" one: heuristics for maximum matchings and maximum traveling salesman problems

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.

[1]  M. Shirosaki.  Another proof of the defect relation for moving targets , 1991 .

[2]  W. Cook,et al.  Computing MinimumWeight Perfect Matchings , 1999 .

[3]  Sándor P. Fekete,et al.  On minimum stars, minimum Steiner stars, and maximum matchings , 1999, SCG '99.

[4]  Kurt Mehlhorn,et al.  Implementation of $O(nm \log n)$ weighted matchings: The power of data structures , 2000 .

[5]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[6]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[7]  Kasturi R. Varadarajan.  A divide-and-conquer algorithm for min-cost perfect matching in the plane , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[8]  Sándor P. Fekete,et al.  On Minimum Stars and Maximum Matchings , 2000, Discret. Comput. Geom..

[9]  Sylvia C. Boyd,et al.  Optimizing over the subtour polytope of the travelling salesman problem , 1990, Math. Program..

[10]  Joseph S. B. Mitchell,et al.  A maximumb-matching problem arising from median location models with applications to the roommates problem , 1998, Math. Program..

[11]  A. J. Jones,et al.  Estimating the Held-Karp lower bound for the geometric TSP , 1997 .

[12]  A. Löbel.  Solving Large-Scale Real-World Minimum-Cost Flow Problems by a Network Simplex Method , 1996 .

[13]  Joseph S. B. Mitchell,et al.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[14]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[15]  Gerhard J. Woeginger,et al.  The Maximum Traveling Salesman Problem Under Polyhedral Norms , 1998, IPCO.

[16]  Sándor P. Fekete,et al.  Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems , 2001, ALENEX.

[17]  Gerhard J. Woeginger,et al.  The geometric maximum traveling salesman problem , 2002, JACM.

[18]  Sándor P. Fekete,et al.  Simplicity and hardness of the maximum traveling salesman problem under geometric distances , 1999, SODA '99.

[19]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[20]  Kurt Mehlhorn,et al.  Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures , 2000, Algorithm Engineering.

[21]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[22]  Pravin M. Vaidya,et al.  Geometry helps in matching , 1989, STOC '88.

[23]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[24]  Harold W. Kuhn,et al.  A note on Fermat's problem , 1973, Math. Program..

[25]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[26]  Chandrajit L. Bajaj,et al.  The algebraic degree of geometric optimization problems , 1988, Discret. Comput. Geom..

[27]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[28]  R. Bixby,et al.  On the Solution of Traveling Salesman Problems , 1998 .

[29]  Harold N. Gabow,et al.  Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.

[30]  William J. Cook,et al.  Computing Minimum-Weight Perfect Matchings , 1999, INFORMS J. Comput..