An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
Author:
- 1 March 2003
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 126 (1) , 83-113
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Approximating minimum-size k-connected spanning subgraphs via matching2002
- Applications of a poset representation to edge connectivity and graph rigidity2002
- On 2-Coverings and 2-Packings of Laminar Families1999
- An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs1998
- Biconnectivity approximations and graph carvingsJournal of the ACM, 1994
- Approximation algorithms for graph augmentation1992
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Approximation Algorithms for Several Graph Augmentation ProblemsSIAM Journal on Computing, 1981
- An O(v|v| c |E|) algoithm for finding maximum matching in general graphs1980
- Augmentation ProblemsSIAM Journal on Computing, 1976