Ajit Agrawal, Philip Klein, R. Ravi  Home/Search
Context Related
| brown.edu/pub/techreport...cs9032.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: indiana.edu/pub/ucstri/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with link-costs and, for each pair fi; jg of nodes, an edge-connectivity requirement r ij . The goal is to find a minimum-cost network using the available links and satisfying the requirements. Our algorithm outputs a solution whose cost is within 2dlog 2 (r + 1)e of optimal, where r is the highest requirement value. In the course of... (Update)
Cited by: More
Approximation Algorithms for Finding Low-Degree Subgraphs - Klein, Krishnan.. (2004) (Correct)
An Approximation Algorithm for Minimum-Cost.. - Ravi, Williamson (2002) (Correct)
Group Strategyproof Mechanisms via Primal-Dual Algorithms - Pal, Tardos (2003) (Correct)
Active bibliography (related documents): More All
2.4: Steiner Trees and Beyond: Approximation Algorithms for Network.. - Ravi (1993) (Correct)
1.5: A primal-dual approximation algorithm for the Steiner forest problem - Ravi (1993) (Correct)
0.6: A nearly best-possible approximation algorithm for.. - Klein, Ravi (1993) (Correct)
Similar documents based on text: More All
0.3: On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs - Ageev (1999) (Correct)
0.2: Approximation Algorithms for Minimum-Cost k-Vertex.. - Cheriyan, Vempala, Vetta (2002) (Correct)
0.1: Integrating Association Rule Mining Algorithms With.. - Hipp, Güntzer, Grimmer (2001) (Correct)
Related documents from co-citation: More All
60: General approximation technique for constrained forest problems - Goemans, Williamson - 1992
37: A primal-dual approximation algorithm for generalized Steiner network problems (context) - Williamson, Goemans et al. - 1995
25: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
BibTeX entry: (Update)
A. Agrawal, P. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM journal on Computing, 24:440-456, 1995. http://citeseer.ist.psu.edu/agrawal94when.html More
@inproceedings{ agrawal91when,
author = "Ajit Agrawal and Philip Klein and R. Ravi",
title = "When trees collide: an approximation algorithm for the generalized {Steiner} problem on networks",
pages = "134--144",
year = "1991",
url = "citeseer.ist.psu.edu/agrawal94when.html" }
Citations (may not include all citations):773 Reducibility among combinatorial problems (context) - Karp - 1972
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1993
212 Probabilistic checking of proofs: a new characterization of .. - Arora, Safra - 1992
203 Approximating clique is almost NP-complete (context) - Feige, Goldwasser et al. - 1991
186 Steiner tree problems (context) - Hwang, Richards - 1992
163 The complexity of enumeration and reliability problems (context) - Valiant - 1979
163 A fast algorithm for Steiner trees (context) - Kou, Markowsky et al. - 1981
160 A general approximation technique for constrained forest pro.. - Goemans, Williamson - 1992
146 Steiner Problem in Networks: A Survey (context) - Winter - 1985
133 An approximate solution for the Steiner problem in graphs (context) - Takahashi, Matsuyama - 1980
85 The Combinatorics of Network Reliability (context) - Colbourn - 1987
79 When trees collide: an approximation algorithm for the gener.. - Agrawal, Klein et al. - 1990
74 Multi-terminal network flows (context) - Gomory, Hu - 1961
61 A primaldual approximation algorithm for generalized Steiner.. (context) - Williamson, Goemans et al. - 1993
59 Improved approximations for the Steiner tree problem (context) - Berman, Ramaiyer - 1992
46 Improved approximation algorithms for network design problem.. - Goemans, Goldberg et al. - 1994
36 The computation of nearly minimal Steiner trees in graphs (context) - Rayward-Smith - 1983
33 Network synthesis and optimum network design problems: model.. (context) - Minoux - 1989
31 A faster approximation algorithm for the Steiner problem in .. (context) - Mehlhorn - 1988
30 A nearly best-possible approximation algorithm for node-weig.. - Klein, Ravi - 1993
28 An efficient approximation algorithm for the survivable netw.. - Gabow, Goemans et al. - 1993
27 When cycles collapse: a general approximation technique for .. - Ravi, Klein - 1993
21 The design of minimum-cost survivable networks (context) - Steiglitz, Weiner et al. - 1969
20 A dual ascent approach for Steiner tree problems on a direct.. (context) - Wong - 1984
16 Matching, Euler tours and the Chinese postman (context) - Edmonds, Johnson - 1973
14 The node-weighted Steiner tree problem (context) - Segev - 1987
12 A bound for the Steiner tree problem in graphs (context) - Plesnik - 1981
11 Worst-case analysis of network design problem heuristics (context) - Wong - 1980
11 An integer linear programming approach to the Steiner proble.. (context) - Aneja - 1980
10 personal communication (context) - Berman - 1991
10 Survivable networks, linear programming relaxations and the .. (context) - Goemans, Bertsimas - 1993
5 A data structure for bicategories, with application to speed.. - Klein - 1993
5 personal communication (context) - Khuller - 1991
4 The 11/6-approximation algorithm for the Steiner problem on .. (context) - Zelikovsky
4 Approximation algorithms for Steiner tree problems (context) - Sullivan - 1982
3 Integer solution to synthesis of communication network (context) - Sridhar, Chandrasekaran - 1989
3 Probabilistic analysis of an LP relaxation bound for the Ste.. (context) - Jain - 1989
3 Edge-packings of graphs and network reliability (context) - Colbourn - 1988
3 The generalized Steiner problem (context) - Krarup - 1978
2 Une heuristique pour le problem de l'arbre de Steiner (context) - El-Arbi - 1978
2 Generalized Steiner Problem in Outerplanar graphs (context) - Winter - 1987
1 An Algorithmic Theory of Numbers (context) - L'ovasz - 1986
1 An approximate max-flow min-cut relation for multicommodity .. (context) - Klein, Rao et al.
1 Synthesis of a communication net (context) - Chien - 1960
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index): More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998) (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning.. (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