Abstract
We consider complete graphs with nonnegative edge weights. A p-matching is a set of p disjoint edges. We prove the existence of a maximal (with respect to inclusion) matching M that contains for any P < |M| p edges whose total weight is at least 1/√2 of the maximum weight of a p-matching. We use this property to approximate graph partitioning problems in which the sizes of the parts of the partitioning are given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Feo, O. Goldschmidt and M. Khellaf, “One half approximation algorithms for the k-partition problem”, Operations Research 40, 1992, S170–S172.
T. Feo and M. Khellaf, “A class of bounded approximation algorithms for graph partitioning”, Networks 20, 1990, 181–195.
R. Hassin, S. Rubinstein and A. Tamir, “Approximation algorithms for maximum dispersion”, Operations Research Letters, 21 (1997), 133–137.
B. Korte and D. Hausmann, “An analysis of the greedy heuristic for independence systems,” Annals of Discrete Mathematics 2, 1978, 65–74.
G. Woeginger, private communication.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hassin, R., Rubinstein, S. (2000). Robust Matchings and Maximum Clustering. In: Algorithm Theory - SWAT 2000. SWAT 2000. Lecture Notes in Computer Science, vol 1851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44985-X_23
Download citation
DOI: https://doi.org/10.1007/3-540-44985-X_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67690-4
Online ISBN: 978-3-540-44985-0
eBook Packages: Springer Book Archive