Samir Khuller, Balaji Raghavachari, Neal Young  Home/Search
Context Related
Links: ACM DBLP | umd.edu/pub/papers/pa...CSTR3134.ps.Z umd.edu/Library/TRs/C...CSTR3134.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: . The MEG (minimum equivalent graph) problem is the following: "Given a directed graph, find a smallest subset of the edges that maintains all reachability relations between nodes." This problem is NP-hard; this paper gives an approximation algorithm achieving a performance guarantee of about 1:64 in polynomial time. The algorithm achieves a performance guarantee of 1:75 in the time required for transitive closure. The heart of the MEG problem is the minimum SCSS (strongly connected spanning... (Update)
Context of citations to this paper: More
.... and its generalizations to higher degrees of connectivity has practical applications and has been studied extensively, see e.g. [1, 10, 13, 14, 17]. Furthermore, for a given class of digraphs, which is closed under the operation of taking induced subdigraphs, one can find the...
...by Eva Tardos NSF PYI grant DDM 9157199. 1 The only known c approximation algorithm for any c 2 works by repeatedly contracting cycles [6]. Each cycle contracted is either a longest cycle in the current graph, or has length at least some constant k. The set of contracted...
Cited by: More
Approximating Minimum-Size k-Connected Spanning Subgraphs.. - Cheriyan, Thurimella (2000) (Correct)
Approximation Algorithms for Finding Planar and Highly Connected .. - Fernandes (1997) (Correct)
On Strongly Connected Digraphs with Bounded Cycle Length - Khuller, Raghavachari, Young (1996) (Correct)
Similar documents (at the sentence level):
27.6%: Approximation Algorithms for Finding Highly Connected Subgraphs - Khuller (1996) (Correct)
Active bibliography (related documents): More All
1.0: Approximating the Minimum Equivalent Digraph - Khuller, RAGHAVACHARI, YOUNG (1995) (Correct)
0.3: The Complexity of Finding Minimal Spanning Subgraphs - Kelsen, Ramachandran (1991) (Correct)
0.3: Strongly Connected Spanning Subgraphs with the Minimum.. - Bang-Jensen, Huang, Yeo (2000) (Correct)
Similar documents based on text: More All
0.4: Designing Multi-Commodity Flow Trees - Samir Khuller Balaji (1994) (Correct)
0.3: Graph and Network Algorithms - Samir Khuller Department (Correct)
0.3: A Network-Flow Technique for Finding Low-Weight.. - Fekete, Khuller.. (1996) (Correct)
Related documents from co-citation: More All
8: The Transitive Reduction of a Directed Graph (context) - Aho, Garey et al. - 1972
8: An algorithm for finding a minimal equivalent graph of a digraph (context) - Hsu - 1975
8: On strongly connected digraphs with bounded cycle length - Khuller, Raghavachari et al. - 1996
BibTeX entry: (Update)
S. Khuller, B. Raghavachari and N. Young, "Approximating the Minimum Equivalent Digraph," SIAM Journal of Computing, 24 (4), 859--872, 1995. http://citeseer.ist.psu.edu/article/khuller95approximating.html More
@inproceedings{ khuller94approximating,
author = "Khuller and Raghavachari and Young",
title = "Approximating the Minimum Equivalent Digraph",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1994",
url = "citeseer.ist.psu.edu/article/khuller95approximating.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
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992 DBLP
219 and complexity classes (context) - Papadimitriou, Yannakakis et al. - 1991
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
84 an estimate of the chromatic class of a P-graph (context) - Vizing - 1964
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 A primal-dual approximation algorithm for generalized Steine.. (context) - Williamson, Goemans et al. - 1993 ACM DBLP
45 Efficient algorithms for finding minimum spanning trees in u.. (context) - Gabow, Galil et al. - 1986 ACM DBLP
38 Fundamental Algorithms (context) - Knuth - 1973
32 Computationally related problems (context) - Sahni - 1974 DBLP
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 ACM DBLP
22 Structural models: An introduction to the theory of directed.. (context) - Harary, Norman et al. - 1965
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
11 An algorithm for finding a minimal equivalent graph of a dig.. (context) - Hsu - 1975 ACM DBLP
9 Transitive compaction in parallel via branchings (context) - Gibbons, Karp et al. - 1991 ACM DBLP
5 An algorithm for finding the minimum equivalent graph of a d.. (context) - Moyles, Thompson - 1969
4 Finding a minimal transitive reduction in a strongly connect.. (context) - Simon - 1989 ACM DBLP
1 th ACM Symposium on Theory of Computing (context) - Khuller, Vishkin et al. - 1992
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