Joseph Cheriyan, Ramakrishna Thurimella  Home/Search
Context Related
| du.edu/~ramki/papers/complete.ps math.uwaterloo.ca/...kcss23dec99.ps.gz du.edu/~ramki/papers/complete.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: du.edu/~ramki/papers (more) From: du.edu/~ramki/papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Abstract: An efficient heuristic is presented for the problem of finding a minimum-size k- connected spanning subgraph of an (undirected or directed) simple graph G = (V; E). There are four versions of the problem, and the approximation guarantees are as follows: minimum-size k-node connected spanning subgraph of an undirected graph 1 + [1=k], minimum-size k-node connected spanning subgraph of a directed graph 1 + [1=k], minimum-size k-edge connected spanning subgraph of an undirected graph 1... (Update)
Context of citations to this paper: More
.... building on a ratio 2 2(k 1) previously shown in [KR96] For uniform costs, an approximation ratio of 1 1 k is obtained in [CT00] For a complete Euclidean graph, a polynomial time approximation scheme (i.e. factor 1 # for any fixed # 0) is devised in [CL99]...
...in graphs satisfying the triangle inequality. Fernandes [6] improved the approximation ratio to 1.75 for k ECSS. Cheriyan and Thurimella [3] presented an elegant algorithm (which we call the CT algorithm) that achieves a performance ratio of 1 k 1 for unweighted k ECSS. They...
Cited by: More
Hardness of Approximation for Vertex-Connectivity.. - Kortsarz, Krauthgamer, .. (2003) (Correct)
Approximation Algorithms for Finding Planar and Highly Connected .. - Fernandes (1997) (Correct)
Enhancing Techniques in LP Based Approximation Algorithms - Jain (Correct)
Similar documents (at the sentence level):
51.6%: Approximating Minimum-Size k-Connected Spanning Subgraphs.. - Cheriyan, Thurimella (1998) (Correct)
13.1%: Approximating Minimum k-Connected Spanning Subgraphs - Cheriyan (Correct)
12.8%: Approximation Algorithms for Network Problems - Cheriyan, Ravi (1998) (Correct)
Active bibliography (related documents): More All
0.3: Biconnectivity Approximations and Graph Carvings - Khuller, Vishkin (1994) (Correct)
0.3: Fast Algorithms for k-Shredders and k-Node Connectivity.. - Cheriyan, Thurimella (1998) (Correct)
0.3: Minimally K-Edge-Connected Directed Graphs of Maximal Size - Berg, Jordán (2002) (Correct)
Similar documents based on text: More All
0.9: A 3/2 Approximation Algorithm for the Smallest.. - Jothi.. (2003) (Correct)
0.4: Embedding Cartesian Products of Graphs into de Bruijn Graphs - Andreae, Nölle, Schreiber (1995) (Correct)
0.4: An Improved Approximation Algorithm for Minimum Size 2-Edge.. - Cheriyan Sebo (1998) (Correct)
Related documents from co-citation: More All
11: Improved Approximation Algorithms for Uniform Connectivity Problems - Khuller, Raghavachari
6: Approximating the Minimum Equivalent Digraph - Khuller, Raghavachari et al. - 1995
6: A linear-time algorithm for finding a sparse k-connected spanning subgraph of a .. (context) - Nagamochi, Ibaraki - 1992
BibTeX entry: (Update)
J. Cheriyan and R. Thurimella, Approximating minimum-size k-connected spanning subgraphs via matching (extended abstract), 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996) IEEE Comput. Soc. Press Los Alamitos, CA (1996) 292-301. http://citeseer.ist.psu.edu/article/cheriyan98approximating.html More
@inproceedings{ cheriyan96approximating,
author = "Joseph Cheriyan and Ramakrishna Thurimella",
title = "Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract)",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "292-301",
year = "1996",
url = "citeseer.ist.psu.edu/article/cheriyan98approximating.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
957 The Probabilistic Method (context) - Alon, Spencer - 1992
193 Extremal Graph Theory (context) - Bollob'as - 1978
126 Combinatorial Problems and Exercises (context) - Lov'asz - 1993
75 Matching Theory (context) - Lov'asz, Plummer - 1986
56 A linear-time algorithm for finding a sparse k-connected spa.. (context) - Nagamochi, Ibaraki - 1992
55 American Elsevier Publishing Co (context) - Bondy, Murty et al. - 1976
42 Worst-case analysis of a new heuristic for the travelling sa.. (context) - Christofides - 1976
42 Edge-disjoint branchings (context) - Edmonds - 1972
38 A matroid approach to finding edge connectivity and packing .. (context) - Gabow - 1995
33 Faster scaling algorithms for general graph matching problem.. (context) - Gabow, Tarjan - 1991
25 A scaling algorithm for weighted matching on general graphs (context) - Gabow - 1985
22 Approximation algorithms for finding highly connected subgra.. - Khuller - 1996
17 On sparse subgraphs preserving connectivity properties (context) - Frank, Ibaraki et al. - 1993
16 Improved approximation algorithms for biconnected subgraphs .. (context) - Garg, Santosh et al. - 1993
16 Scan-first search and sparse certificates: An improved paral.. (context) - Cheriyan, Kao et al. - 1993
12 On strongly connected digraphs with bounded cycle length - Khuller, Raghavachari et al. - 1996
11 Techniques for the Design of Parallel Graph Algorithms (context) - Thurimella - 1989
11 Minimale n-fach kantenzusammenhangende Graphen (context) - Mader - 1971
10 Submodular functions in graph theory (context) - Frank - 1993
9 Ecken vom Grad n in minimalen n-fach zusammenhangenden Graph.. (context) - Mader - 1972
8 Computing minimal spanning subgraphs in linear time - Han, Kelsen et al. - 1995
8 Increasing the vertex-connectivity in directed graphs (context) - Jord'an - 1993
6 in Handbook of Operations Research and Management Science (context) - Gerards - 1995
6 Random sampling in cut, flow, and network design problems - Karger - 1994
5 Approximating matchings in parallel (context) - Fischer, Goldberg et al. - 1993
5 A decomposition theorem for bipartite graphs (context) - Gupta - 1967
5 On finding minimal two-connected subgraphs - Kelsen, Ramachandran - 1995
4 The number of vertices of degree k in a minimally k-edge-con.. (context) - Cai - 1993
3 Improving biconnectivity approximation via local optimizatio.. (context) - Chong, Lam - 1996
3 Towards more precise parallel biconnectivity approximation (context) - Chong, Lam - 1996
3 A better approximation ratio for the minimum k-edge-connecte.. - Fernandes - 1997
3 Approximating biconnectivity in parallel (context) - Chong, Lam - 1995
2 Minimal n-fach zusammenhangenden Digraphen (context) - Mader - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.du.edu/~ramki/papers.html): More
Fast Algorithms for k-Shredders and k-Node Connectivity.. - Cheriyan, Thurimella (1996) (Correct)
Sub-Linear Distributed Algorithms for Sparse Certificates and.. - Thurimella (1995) (Correct)
On Computing Connected Components of Line Segments - Lopez, Thurimella (1995) (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