Abstract
In an ESA 2011 paper, Couëtoux [2] gives a beautiful 3/2-approximation algorithm for the problem of finding a minimum-cost set of edges such that each connected component has at least k vertices in it. The algorithm improved on previous 2-approximation algorithms for the problem. In this paper, we reanalyze Couëtoux's algorithm using dual-fitting and show how to generalize the algorithm to a broader class of graph problems previously considered in the literature. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Davis, J. M., & Williamson, D. P. (2012). A dual-fitting 3/2-approximation algorithm for some minimum-cost graph problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7501 LNCS, pp. 373–382). https://doi.org/10.1007/978-3-642-33090-2_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
