Approximation algorithms for graph augmentation
Authors:
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 330-341
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A matroid approach to finding edge connectivity and packing arborescences1991
- On finding a smallest augmentation to biconnect a graph (Extended abstract)Lecture Notes in Computer Science, 1991
- An application of submodular flowsLinear Algebra and its Applications, 1989
- Edge-connectivity augmentation problemsJournal of Computer and System Sciences, 1987
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- On the relationship between the biconnectivity augmentation and travelling salesman problemsTheoretical Computer Science, 1982
- Approximation Algorithms for Several Graph Augmentation ProblemsSIAM Journal on Computing, 1981
- Smallest Augmentations to Biconnect a GraphSIAM Journal on Computing, 1977
- Augmentation ProblemsSIAM Journal on Computing, 1976