Improving biconnectivity approximation via local optimization
Conference
·
OSTI ID:416782
- Univ. of Hong Kong (Hong Kong)
The problem of finding the minimum biconnected spanning subgraph of an undirected graph is NP-hard. A lot of effort has been made to find biconnected spanning subgraphs that approximate to the minimum one as close as possible. Recently, new polynomial-time (sequential) approximation algorithms have been devised to improve the approximation factor from 2 to 5/3 , then 3/2, while NC algorithms have also been known to achieve 7/4 + {epsilon}. This paper presents a new technique which can be used to further improve parallel approximation factors to 5/3 + {epsilon}. In the sequential context, the technique reveals an algorithm with a factor of {alpha} + 1/5, where a is the approximation factor of any 2-edge connectivity approximation algorithm.
- OSTI ID:
- 416782
- Report Number(s):
- CONF-960121--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Approximating minimum-size k-connected spanning subgraphs via matching
A better approximation algorithm for finding planar subgraphs
Uniform generation of combinatorial structures
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:457660
A better approximation algorithm for finding planar subgraphs
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416781
Uniform generation of combinatorial structures
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416827