Samir Khuller  Home/Search
Context Related
Links: ACM | umd.edu/pub/papers/pa...CSTR3398.ps.Z umd.edu/Library/TRs/C...CSTR3398.ps.Z 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: umd.edu/TRs/TRnoabs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Contents 1 Introduction 2 1.1 Outline of Chapter : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2 Edge-Connectivity Problems 3 2.1 Weighted Edge-Connectivity : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2.2 Unweighted Edge-Connectivity : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.2.1 2 Edge-Connectivity : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.2.2 Edge-Connectivity : : : : : : : : : : : : : : :... (Update)
Context of citations to this paper: More
.... E) with nonnegative edge costs, a subgraph of minimum cost that satisfies certain connectivity requirements, see e.g. the surveys [Fra94,Khu96] A fundamental problem in this area is the vertex connectivity variant of the survivable network design problem (SNDP) In this...
.... Cheriyan Ramakrishna Thurimella y September 15, 1996 (Revised: November 27, 1996, March 19,1998 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)...
Cited by: More
Fast Approximation Schemes for Euclidean - Multi-Connectivity Problems.. (Correct)
Approximating Minimum-Size k-Connected Spanning Subgraphs.. - Cheriyan, Thurimella (2000) (Correct)
Hardness of Approximation for Vertex-Connectivity.. - Kortsarz, Krauthgamer, .. (2003) (Correct)
Similar documents (at the sentence level):
16.0%: Approximating the Minimum Equivalent Digraph - Khuller, RAGHAVACHARI, YOUNG (1995) (Correct)
14.2%: Approximating The Minimum Equivalent Digraph - Khuller, Raghavachari, Young (1995) (Correct)
9.8%: Biconnectivity Approximations and Graph Carvings - Khuller, Vishkin (1994) (Correct)
Active bibliography (related documents): More All
0.5: Improved Approximation Algorithms for Uniform Connectivity.. - Khuller, Raghavachari (1995) (Correct)
0.3: On Strongly Connected Digraphs with Bounded Cycle Length - Khuller, Raghavachari, Young (1996) (Correct)
0.3: Undirected Vertex-Connectivity Structure and Smallest.. - Hsu (1995) (Correct)
Similar documents based on text: More All
0.7: A 3/2 Approximation Algorithm for the Smallest.. - Jothi.. (2003) (Correct)
0.3: Preserving And Increasing Local Edge-Connectivity In.. - Bang-Jensen, Frank.. (1995) (Correct)
0.2: Approximation Algorithms for Minimum-Cost k-Vertex.. - Cheriyan, Vempala, Vetta (2002) (Correct)
Related documents from co-citation: More All
10: Improved Approximation Algorithms for Uniform Connectivity Problems - Khuller, Raghavachari
8: Approximation algorithms for several graph augmentation problems (context) - Frederickson, J'aJ'a - 1981
8: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
BibTeX entry: (Update)
S. Khuller, "Approximation algorithms for finding highly connected subgraphs," in Approximation Algorithms for NP-hard problems, D. Hochbaum (ed.), PWS Publishing Company (1996). http://citeseer.ist.psu.edu/article/khuller96approximation.html More
@techreport{ khuller95approximation,
author = "Samir Khuller",
title = "Approximation Algorithms for Finding Highly Connected Subgraphs",
number = "CS-TR-3398",
year = "1995",
url = "citeseer.ist.psu.edu/article/khuller96approximation.html" }
Citations (may not include all citations):4212 Computers and intractability: A guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 1989 ACM
1450 The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
164 Society for Industrial and Applied Mathematics (context) - Tarjan, structures et al. - 1983
160 A general approximation technique for constrained forest pro.. - Goemans, Williamson - 1992 ACM DBLP
145 Easy problems for tree-decomposable graphs - Arnborg, Lagergren et al. - 1991 ACM DBLP
136 Fast algorithms for finding nearest common ancestors (context) - Harel, Tarjan - 1984 ACM DBLP
79 When trees collide: An approximation algorithm for the gener.. - Agrawal, Klein et al. - 1991 ACM DBLP
62 The transitive reduction of a directed graph (context) - Aho, Garey et al. - 1972 DBLP
61 Augmenting graphs to meet edge-connectivity requirements (context) - Frank - 1992 ACM DBLP
56 Linear time algorithms for finding sparse k-connected spanni.. (context) - Nagamochi, Ibaraki - 1992
45 Efficient algorithms for finding minimum spanning trees in u.. (context) - Gabow, Galil et al. - 1986
38 Fundamental Algorithms (context) - Knuth - 1973
38 A matroid approach to finding edge connectivity and packing .. (context) - Gabow - 1991 ACM DBLP
35 Biconnectivity approximations and graph carvings - Khuller, Vishkin - 1994 ACM DBLP
33 Improved Approximation Algorithms for Uniform Connectivity P.. - Khuller, Raghavachari - 1994 ACM DBLP
33 A fast algorithm for optimally increasing the edgeconnectivi.. (context) - Naor, Gusfield et al. - 1990
31 Approximation algorithms for several graph augmentation prob.. (context) - Frederickson, J'aJ'a - 1981
27 When cycles collapse: A general approximation technique for .. - Klein, Ravi - 1993
27 An approximation algorithm for minimum-cost vertexconnectivi.. - Ravi, Williamson - 1995
26 Approximation algorithms for graph augmentation (context) - Khuller, Thurimella - 1993 ACM DBLP
26 Approximation algorithms for graph augmentation (context) - Khuller, Thurimella - 1992 ACM DBLP
19 SIAM Journal on Computing (context) - Eswaran, Tarjan et al. - 1976
17 The maximum connectivity of a graph (context) - Harary - 1962
16 Improved approximation algorithms for biconnected subgraphs .. (context) - Garg, Santosh et al. - 1993 ACM DBLP
12 On strongly connected digraphs with bounded cycle length - Khuller, Raghavachari et al. - 1994 ACM DBLP
12 Linear Programming Relaxations and the Parsimonious Property (context) - Goemans, Bertsimas et al. - 1993
12 Linear Algebra and its Applications (context) - Frank, Tardos et al. - 1989
11 An algorithm for finding a minimal equivalent graph of a dig.. (context) - Hsu - 1975 ACM DBLP
11 Techniques for the design of parallel graph algorithms (context) - Thurimella - 1989
10 Annals of Discrete Mathematics (context) - Edmonds, intersection - 1979
9 Graph Augmentation and Related Problems: Theory and Practice - Hsu - 1993
7 vertex connectivity and sparse certificates (context) - Cheriyan, Kao et al. - 1993
5 An algorithm for finding the minimum equivalent graph of a d.. (context) - Moyles, Thompson - 1969
1 rd Annual Symposium on Theory of Computing (context) - Cheriyan, Thurimella et al. - 1991
1 th Annual ACM-SIAM Symposium on Discrete Algorithms (context) - Khuller, Raghavachari et al. - 1994
1 Highly connected factors with a small number of edges (context) - Nishizeki, Poljak
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.umd.edu/TRs/TR-no-abs.html): More
Iterative Methods For Stabilized Discrete Convection-Diffusion.. - Shih, Elman (1998) (Correct)
Perturbation Theory for the Singular Value Decomposition - Stewart (1990) (Correct)
Adaptive Runtime Support for Direct Simulation Monte Carlo.. - Moon, Saltz (1994) (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