Abstract
Let H be a laminar family of subsets of a groundset V. A k-cover of H is a multiset C of edges on V such that for every subset S in H, C has at least k edges that have exactly one end in S. A k-packing of H is a multiset P of edges on V such that for every subset S in H, P has at most k · u(S) edges that have exactly one end in S. Here, u assigns an integer capacity to each subset in H. Our main results are: (a) Given a k-cover C of H, there is an efficient algorithm to find a 1-cover contained in C of size ≤ k|C|=(2k - 1). For 2-covers, the factor of 2=3 is best possible. (b) Given a 2-packing P of H, there is an efficient algorithm to find a 1-packing contained in P of size ≥ |P|/3. The factor of 1/3 for 2-packings is best possible.
These results are based on efficient algorithms for finding appropriate colorings of the edges in a k-cover or a 2-packing, respectively, and they extend to the case where the edges have nonnegative weights. Our results imply approximation algorithms for some NP-hard problems in connectivity augmentation and related topics. In particular, we have a 4/3-approximation algorithm for the following problem: Given a tree T and a set of nontree edges E that forms a cycle on the leaves of T, find a minimum-size subset E′ of E such that T + E′ is 2-edge connected.
Supported in part by NSERC research grant OGP0138432.
Supported in part by the Hungarian Scientific Research Fund no. OTKA T29772 and T30059.
Supported in part by NSF career grant CCR-9625297.
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
W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver, Combinatorial Optimization, JohnWiley & Sons, NewYork, 1998.
K. Eswaran and R. E. Tarjan, “Augmentation problems,” SIAM J. Computing 5 (1976), 653–665.
A. Frank, “Connectivity augmentation problems in network design,” in Mathematical Programming: State of the Art 1994, (Eds. J. R. Birge and K. G. Murty), The University of Michigan, Ann Arbor, MI, 1994, 34–63.
G. N. Frederickson and J. Ja’Ja’, “Approximation algorithms for several graph augmentation problems,” SIAM J. Comput. 10 (1981), 270–283.
N. Garg, M. Yannakakis, and V. Vazirani, “Primal-dual approximation algorithms for integral flow and multicut in trees,” Algorithmica 18 (1997), 3–20.
D. S. Hochbaum, “Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems,” in Approximation algorithms for NP-hard problems, Ed. D. S. Hochbaum, PWS co., Boston, 1996.
K. Jain, “A factor 2 approximation algorithm for the generalized Steiner network problem,” Proc. 39th IEEE FOCS, Palo Alto, CA, November 1998.
S. Khuller, “Approximation algorithms for finding highly connected subgraphs,” in Approximation algorithms for NP-hard problems, Ed. D. S. Hochbaum, PWS publishing co., Boston, 1996.
S. Khuller and U. Vishkin, “Biconnectivity approximations and graph carvings,” Journal of the ACM 41 (1994), 214–235.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheriyan, J., Jordán, T., Ravi, R. (1999). On 2-Coverings and 2-Packings of Laminar Families. In: Nešetřil, J. (eds) Algorithms - ESA’ 99. ESA 1999. Lecture Notes in Computer Science, vol 1643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_44
Download citation
DOI: https://doi.org/10.1007/3-540-48481-7_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66251-8
Online ISBN: 978-3-540-48481-3
eBook Packages: Springer Book Archive