M.X. Goemans, A.V. Goldberg, S.A. Plotkin, D.B. Shmoys, E. Tardos, D.P. Williamson  Home/Search
Context Related
| cornell.edu/home/eva/design.ps 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: cornell.edu/home/eva/eva (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider a class of network design problems in which one needs to find a minimum-cost network satisfying certain connectivity requirements. For example, in the survivable network design problem, the requirements specify that there should be at least r(v; w) edge-disjoint paths between each pair of vertices v and w. We present an approximation algorithm with a performance guarantee of 2H(fmax ) = 2(1 + 2 + 3 + \Delta \Delta \Delta + fmax ) where fmax is the maximum requirement. This ... (Update)
Cited by: More
An Approximation Algorithm for Minimum-Cost.. - Ravi, Williamson (2002) (Correct)
The Primal-Dual Method for Approximation Algorithms - Williamson (Correct)
Building Edge-Failure Resilient Networks - Chekuri, Gupta, Kumar, Naor, Raz (2002) (Correct)
Similar documents (at the sentence level):
57.4%: Improved Approximation Algorithms for Network Design.. - Goemans, Goldberg.. (Correct)
Active bibliography (related documents): More All
0.3: A Fast Algorithm for Computing Steiner Edge Connectivity - Cole, Hariharan (2003) (Correct)
0.3: An Efficient Approximation Algorithm for the Survivable .. - Gabow, Goemans.. (1993) (Correct)
0.3: Packing Steiner trees - Jain, Mahdian, Salavatipour (2003) (Correct)
Similar documents based on text: More All
0.2: Using Interior Point Methods for Fast Parallel.. - Goldberg, Plotkin.. (1992) (Correct)
0.2: Approximation algorithms. Bibliography for Lectures 11 and 12 - Rabani (1996) (Correct)
0.2: A 1.47-Approximation Algorithm for a Preemptive.. - Goemans, Wein.. (1997) (Correct)
Related documents from co-citation: More All
29: General approximation technique for constrained forest problems - Goemans, Williamson - 1992
21: A primal-dual approximation algorithm for generalized Steiner network problems (context) - Williamson, Goemans et al. - 1995
20: When trees collide: An approximation algorithm for the generalized Steiner probl.. - Agrawal, Klein et al. - 1995
BibTeX entry: (Update)
M.X. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, and D.P. Williamson, Improved Approximation Algorithms for Network Design Problems, SODA '94, pp. 223--232. http://citeseer.ist.psu.edu/637599.html More
@inproceedings{ goemans94improved,
author = "Michel X. Goemans and Andrew V. Goldberg and Serge A. Plotkin and David B. Shmoys and Eva Tardos and David P. Williamson",
title = "Improved Approximation Algorithms for Network Design Problems",
booktitle = "Symposium on Discrete Algorithms",
pages = "223-232",
year = "1994",
url = "citeseer.ist.psu.edu/637599.html" }
Citations (may not include all citations):333 Geometric Algorithm and Combinatorial Optimization (context) - Grotschel, Lov'asz et al. - 1988
160 A general approximation technique for constrained forest pro.. - Goemans, Williamson - 1995
79 When trees collide: An approximation algorithm for the gener.. - Agrawal, Klein et al. - 1995
67 A new algorithm for minimizing convex functions over convex .. (context) - Vaidya - 1989
61 A primal-dual approximation algorithm for generalized Steine.. (context) - Williamson, Goemans et al. - 1995
32 Network design and transportation planning: Models and algor.. (context) - Magnanti, Wong - 1984
28 An efficient approximation algorithm for the survivable netw.. - Gabow, Goemans et al. - 1993
27 When cycles collapse: A general approximation technique for .. - Klein, Ravi - 1993
14 the structure of all minimum cuts in a network and applicati.. (context) - Picard, Queyranne - 1980
12 linear programming relaxations and the parsimonious property (context) - Goemans, Bertsimas - 1993
11 the design of approximation algorithms for a class of graphs.. (context) - Williamson - 1993
8 A scaling technique for better network design (context) - Aggarwal, Garg - 1994
3 Preserving and increasing local edge-connectivity in mixed g.. (context) - Bang-Jensen, Frank et al. - 1995
2 Blocking small cuts in a network (context) - Bienstock, Diaz - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cornell.edu/home/eva/eva.html): More
Combinatorial Algorithms - For The Generalized (Correct)
Approximation Algorithms for a Directed Network Design Problem - Melkonian, Tardos (1999) (Correct)
The Quickest Transshipment Problem - Bruce Hoppe Eva (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