Approximating the minimum equivalent digraph

Authors:
Samir Khuller;Balaji Raghavachari;Neal E. Young
Affiliations:
Computer Science Department and Institute for Advanced Computer Studies, University of Maryland, College Park, MD;Computer Science Department, The University of Texas at Dallas, Box 830688, Richardson, TX;Computer Science Department, Princeton University, Princeton, NJ and University of Maryland Institute for Advanced Computer Studies, College Park, MD
Venue:
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Year:
1994

Citing 15
Cited 3

Data structures and network algorithms

Data structures and network algorithms
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
Introduction to algorithms

Introduction to algorithms
Finding a minimal transitive reduction in a strongly connected digraph within linear time

WG '89 Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science
When trees collide: an approximation algorithm for the generalized Steiner problem on networks

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Easy problems for tree-decomposable graphs

Journal of Algorithms
Transitive compaction in parallel via branchings

Journal of Algorithms
Biconnectivity approximations and graph carvings

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A general approximation technique for constrained forest problems

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A primal-dual approximation algorithm for generalized Steiner network problems

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Maintaining directed reachability with few edges

Maintaining directed reachability with few edges
Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An Algorithm for Finding a Minimum Equivalent Graph of a Digraph

Journal of the ACM (JACM)
An Algorithm for Finding a Minimal Equivalent Graph of a Digraph

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Scientific foundations to the multilevel method

IEEE/ACM Transactions on Networking (TON)
Discovery and regeneration of hidden emails

Proceedings of the 2005 ACM symposium on Applied computing
A rounding by sampling approach to the minimum size k-arc connected subgraph problem

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Approximating the minimum equivalent digraph

Quantified Score

Visualization

Abstract