Factor 4/3 Approximations for Minimum 2-Connected Subgraphs
Authors:
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 262-273
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A New Bound for the 2-Edge Connected Subgraph ProblemLecture Notes in Computer Science, 1998
- Biconnectivity approximations and graph carvingsJournal of the ACM, 1994
- Geometric Algorithms and Combinatorial Optimization1988