A better approximation algorithm for finding planar subgraphs
Conference
·
OSTI ID:416781
- Georgia Inst. of Technology, Atlanta, GA (United States)
- Max-Planch-Inst. fuer Informatik, Saarbruecken (Germany)
The MAXIMUM PLANAR SUBGRAPH problem-given a graph G, find a largest planar subgraph of G-has applications in circuit layout, facility layout, and graph drawing. No previous polynomial-time approximation algorithm for this NP-Complete problem was known to achieve a performance ratio larger than 1/3, which is achieved simply by producing a spanning tree of G. We present the first approximation algorithm for MAXIMUM PLANAR SUBGRAPH with higher performance ratio (2/5 instead of 1/3). We also apply our algorithm to find large outerplanar subgraphs. Last, we show that both MAXIMUM PLANAR SUBGRAPH and its complement, the problem of removing as few edges as possible to leave a planar subgraph, are Max SNP-Hard.
- OSTI ID:
- 416781
- Report Number(s):
- CONF-960121--; CNN: Grant CCR-9319106; Contract 200975/92-7
- Country of Publication:
- United States
- Language:
- English
Similar Records
Approximate and exact algorithms for the maximum planar subgraph problem
A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
Level-treewidth property, exact algorithms and approximation schemes
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36323
A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
Conference
·
Sun Jun 01 00:00:00 EDT 1997
·
OSTI ID:471720
Level-treewidth property, exact algorithms and approximation schemes
Conference
·
Sun Jun 01 00:00:00 EDT 1997
·
OSTI ID:471394