Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals

Download PDF
Open Webpage

Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao

Published: 01 Jan 2013, Last Modified: 10 May 2024Algorithmica 2013EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Euclidean optimization problems such as TSP and minimum-length matching admit fast partitioning algorithms that compute near-optimal solutions on typical instances.