Loading...
Please wait, while we are loading the content...
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph (1999)
| Content Provider | CiteSeerX |
|---|---|
| Author | Cheriyan, J. Sebő, A. Szigeti, Z. |
| Abstract | We give a 17 12-approximation algorithm for the following NP-hard problem: Given a simple undirected graph, nd a 2-edge connected spanning subgraph that has the minimum number of edges. The best previous approximation guarantee was 3 2. If the well known |
| File Format | |
| Publisher Date | 1999-01-01 |
| Access Restriction | Open |
| Subject Keyword | Simple Undirected Graph Minimum Number Previous Approximation Guarantee Following Np-hard Problem 12-approximation Algorithm |
| Content Type | Text |