Covering a laminar family by leaf to leaf links
Authors:
- Yael MaduelYMYael Maduel
- Zeev NutovZNZeev Nutov
- 1 July 2010
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 158 (13) , 1424-1432
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2ACM Transactions on Algorithms, 2009
- On the integrality ratio for tree augmentationOperations Research Letters, 2008
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning treeDiscrete Applied Mathematics, 2003
- A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set2001
- A Factor 2 Approximation Algorithm for the Generalized Steiner Network ProblemCombinatorica, 2001
- On 2-Coverings and 2-Packings of Laminar Families1999
- On the relationship between the biconnectivity augmentation and travelling salesman problemsTheoretical Computer Science, 1982