Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14726
For citation please use:
Main Title: Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems
Author(s): Fekete, Sándor P.
Meijer, Henk
Rohe, André
Tietze, Walter
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15953
http://dx.doi.org/10.14279/depositonce-14726
License: http://rightsstatements.org/vocab/InC/1.0/
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 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.
Subject(s): maximum weight matching
Fermat-Weber problem
approximation
heuristic
planar point sets
duality
maximum Traveling Salesman Problem
Issue Date: 2000
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90C27 Combinatorial optimization
90C59 Approximation methods and heuristics
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2000, 695
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-695-2000.pdf
Format: Adobe PDF | Size: 13.26 MB
DownloadShow Preview
Thumbnail
Report-695-2000.ps
Format: Postscript | Size: 459.08 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.