Cristina G. Fernandes  Home/Search
Context Related
| ime.usp.br/~cris/publ/soda97.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ime.usp.br/~cris/publ/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Consider the minimum k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, find a k-edge-connected spanning subgraph of G with minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the first algorithm with a performance ratio smaller than 2 for all k. They proved an upper bound of 1.85 for the performance ratio of their algorithm. We improve their analysis, proving that the performance ratio of... (Update)
Context of citations to this paper: More
...a parallel (deterministic) 1:5 ffl) approximation NC algorithm for the minimum size 2NCSS problem on graphs. Recently, Fernandes [Fe 97, Theorem 5.1] showed that the minimum size 2 ECSS problem on graphs is MAX SNP hard. Table 1 summarizes the approximation guarantees...
Cited by: More
Approximation Algorithms for Finding Planar and Highly Connected .. - Fernandes (1997) (Correct)
Approximating Minimum-Size k-Connected Spanning Subgraphs.. - Cheriyan, Thurimella (1998) (Correct)
Similar documents (at the sentence level):
28.1%: A Better Approximation Ratio for the Minimum Size.. - Fernandes (1998) (Correct)
Active bibliography (related documents): More All
0.1: Approximating Minimum Cuts under Insertions (Extended Abstract) - Henzinger (1994) (Correct)
0.1: A Static 2-Approximation Algorithm for Vertex Connectivity and.. - Henzinger (1995) (Correct)
0.1: Biconnectivity Approximations and Graph Carvings - Khuller, Vishkin (1994) (Correct)
Similar documents based on text: More All
0.9: A 3/2 Approximation Algorithm for the Smallest.. - Jothi.. (2003) (Correct)
0.4: An Approximation for Finding a Smallest 2-Edge-Connected.. - Nagamochi (1999) (Correct)
0.3: Embedding Cartesian Products of Graphs into de Bruijn Graphs - Andreae, Nölle, Schreiber (1995) (Correct)
Related documents from co-citation: More All
3: Edge--Disjoint Branchings (context) - Edmonds - 1973
3: On sparse subgraphs preserving connectivity properties (context) - Frank, Ibaraki et al. - 1993
3: Random Sampling in Cut, Flow, and Network Design Problems - Karger - 1994
BibTeX entry: (Update)
C. G. Fernandes, "A better approximation ratio for the minimum k-edge-connected spanning subgraph problem," Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms 1997, 629--638. http://citeseer.ist.psu.edu/fernandes97better.html More
@inproceedings{ fernandes97better,
author = "Fernandes",
title = "A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1997",
url = "citeseer.ist.psu.edu/fernandes97better.html" }
Citations (may not include all citations):403 Proof Verification and Hardness of Approximation Problems - Arora, Lund et al. - 1992
138 Freeman and Co (context) - Garey, Johnson et al. - 1979
47 Optimization, Approximation, and Complexity Classes (context) - Papadimitriou, Yannakakis - 1991
35 Biconnectivity Approximations and Graph Carvings - Khuller, Vishkin - 1994
33 Improved Approximation Algorithms for Uniform Connectivity P.. - Khuller, Raghavachari - 1995
13 Approximating the Minimum Equivalent Digraph - Khuller, Raghavachari et al. - 1995
10 Algorithms for Parallel k-vertex Connectivity and Sparse Cer.. (context) - Cheriyan, Kao et al. - 1993
6 Random Sampling in Cut, Flow, and Network Design Problems - Karger - 1994
Documents on the same site (http://www.ime.usp.br/~cris/publ/index.html): More
A Better Approximation Algorithm for Finding Planar.. - Calinescu, Fernandes, .. (1996) (Correct)
Finding Large Planar Subgraphs and Large Subgraphs of a.. - Calinescu, Fernandes (1996) (Correct)
A New Approximation Algorithm for Finding Heavy.. - Calinescu.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC