direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Preprints 2000

Solving a ``Hard'' Problem to Approximate an ``Easy'' One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems
Zitatschlüssel Report-695-2000
Autor Sándor P. Fekete and Henk Meijer and André Rohe and Walter Tietze
Jahr 2000
Nummer 695
Notiz Submitted for publication
Institution Technische Universität Berlin, Institut für Mathematik
Zusammenfassung 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 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.
Typ der Publikation Preprint
Link zur Publikation Download Bibtex Eintrag