Ramamurthy Ravi  Home/Search
Context Related
| brown.edu/pub/techreport...cs9341.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 present approximation algorithms for several NP-hard optimization problems arising in network design. Almost all of our algorithms run in polynomial time and output solutions with a worst-case performance guarantee on the quality of the output solution. A typical problem that we consider can be stated as follows: given an undirected graph and certain connectivity requirements, find a subgraph that satisfies these requirements and has minimum cost. In this thesis, we address many different... (Update)
Context of citations to this paper: More
...the number of trees to be merged is small. The analysis of the performance ratio is based on a solution decomposition technique [14, 24, 29, 30] which uses the structure of an optimal solution to derive a bound on the cost of the solution constructed by the approximation...
Cited by: More
Spanning Trees Short Or Small - Ravi, Sundaram, Marathe.. (Correct)
Similar documents (at the sentence level):
17.1%: When cycles collapse: A general approximation technique for.. - Ravi, Klein (1993) (Correct)
5.5%: Many birds with one stone: Multi-objective.. - Ravi, Marathe.. (1993) (Correct)
Active bibliography (related documents): More All
2.4: When trees collide: An approximation algorithm for the.. - Agrawal, Klein, Ravi (1994) (Correct)
1.7: Steiner Tree Problems - Du, Lu, Ngo, Pardalos (2000) (Correct)
1.3: The Power of Local Optimization: Approximation Algorithms for.. - Lu, Ravi (1996) (Correct)
Similar documents based on text: More All
0.7: Fault-Tolerant and Efficient Parallel Computation - Shvartsman (1992) (Correct)
0.5: Approximation Algorithms for Degree-Constrained.. - Ravi, Marathe.. (2001) (Correct)
0.4: Three-Dimensional Shape Representation via Shock Flows - Leymarie (2003) (Correct)
BibTeX entry: (Update)
R. Ravi, "Steiner trees and beyond: Approximation algorithms for network design," Ph. D. Thesis (September 1993), available as Technical Report TR-CS-93-41, Brown University. http://citeseer.ist.psu.edu/ravi93steiner.html More
@techreport{ ravi93steiner,
author = "Ramamurthy Ravi",
title = "Steiner Trees and Beyond: Approximation Algorithms for Network Design",
number = "CS-93-41",
year = "1993",
url = "citeseer.ist.psu.edu/ravi93steiner.html" }
Citations (may not include all citations):4212 Computers and Intractability: A guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
2138 Genetic Algorithms in Search (context) - Goldberg - 1989
1450 The design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
773 Reducibility among combinatorial problems (context) - Karp - 1972
429 An efficient heuristic procedure for partitioning graphs (context) - Kernighan, Lin - 1970
421 A linear-time heuristic for improving network partitions (context) - Fiduccia, Mattheyses - 1982
403 Proof verification and the hardness of approximation problem.. - Arora, Lund et al. - 1992
340 Self-stabilizing systems in spite of distributed control (context) - Dijkstra - 1974
333 Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lov'asz et al. - 1988
303 Princeton University Press (context) - Ford, Fulkerson et al. - 1962
300 the Hardness of Approximating Minimization Problems (context) - Lund, Yannakakis - 1993
293 Approximation algorithms for Combinatorial Problems (context) - Johnson - 1974
276 Linear programming and extensions (context) - Dantzig - 1963
259 Elements of the Theory of Computation (context) - Lewis, Papadimitriou - 1981
203 Approximating clique is almost NPcomplete (context) - Feige, Goldwasser et al. - 1991
193 The Traveling Salesman Problem (context) - Lawler, Lenstra et al. - 1985
186 Steiner tree problems (context) - Hwang, Richards - 1992
175 Shortest connection networks and some generalizations (context) - Prim - 1957
168 An approximate max-flow min-cut theorem for uniform multicom.. (context) - Leighton, Rao - 1988
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
154 The traveling salesman problem and minimum spanning trees: p.. (context) - Held, Karp - 1971
154 The traveling salesman problem and minimum spanning trees (context) - Held, Karp - 1970
148 Combinatorial Optimization: Networks and Matroids (context) - Lawler - 1976
146 Steiner problem in networks : a survey (context) - Winter - 1987
144 The NP-completeness column, an ongoing guide (context) - Johnson - 1984
144 The NP-completeness column, an ongoing guide (context) - Johnson - 1985
141 An effective heuristic algorithm for the Traveling-Salesman .. (context) - Lin, Kernighan - 1973
133 An approximate solution for the Steiner problem in graphs (context) - Takahashi, Matsuyama - 1980
126 Efficient probabilistically checkable proofs - Bellare, Goldwasser et al. - 1993
109 the shortest spanning subtree of a graph and the traveling s.. (context) - Kruskal - 1956
104 Combinatorial Optimization (context) - Papadimitriou, Steiglitz - 1982
104 Approximating maximum independent sets by excluding subgraph.. - Boppana, Halldorsson - 1990
101 the ratio of optimal integral and fractional covers (context) - Lovasz - 1975
87 Approximation algorithms for scheduling unrelated parallel m.. (context) - Lenstra, Shmoys et al. - 1990
85 The combinatorics of network reliability (context) - Colbourn - 1987
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
77 Worst-case analysis of a new heuristic for the traveling sal.. (context) - Christofides - 1976
75 Matching Theory (context) - Lov'asz, Plummer - 1986
70 Primal-dual approximation algorithms for integral flow and m.. (context) - Garg, Vazirani et al. - 1993
69 A greedy heuristic for the set-covering problem (context) - Chv'atal - 1979
68 Steiner minimal trees (context) - Gilbert, Pollak - 1968
61 A primal-dual approximation algorithm for generalized Steine.. (context) - Williamson, Goemans et al. - 1993
59 Improved approximations for the Steiner tree problem (context) - Berman, Ramaiyer - 1992
52 An analysis of several heuristics for the traveling salesman.. (context) - Rosenkrantz, Stearns et al. - 1977
50 On Steiner minimal trees with rectilinear distance (context) - Hwang - 1976
50 The Steiner problem in graphs (context) - Dreyfus, Wagner - 1971
46 Balancing Minimum Spanning and Shortest Path Trees (context) - Khuller, Raghavachari et al. - 1993
46 Improved approximation algorithms for network design problem.. - Goemans, Goldberg et al. - 1993
45 Approximation through multicommodity flow (context) - Klein, Agrawal et al. - 1990
45 A method for solving traveling-salesman problems (context) - Croes - 1958
44 Many birds with one stone: Multi-objective approximation alg.. - Ravi, Marathe et al. - 1993
42 Augmentation problems (context) - Eswaran, Tarjan - 1976
40 An unified approach to approximation algorithms for bottlene.. (context) - Hochbaum, Shmoys - 1986
39 ffl-approximations with minimum packing constraint violation (context) - Lin, Vitter - 1992
37 Probabilistic checking of proofs (context) - Arora, Safra - 1992
36 Spanning trees short or small - Ravi, Sundaram et al. - 1993
36 The computation of nearly minimal Steiner trees in graphs (context) - Rayward-Smith - 1983
35 On well-partial-order theory and its applications to combina.. (context) - Fellows, Langston - 1988
35 On approximating the longest path in a graph - Karger, Motwani et al. - 1993
35 Biconnectivity approximations and graph carvings - Khuller, Vishkin - 1993
34 Steiner's problem in graphs and its implications (context) - Hakimi - 1971
33 Network synthesis and optimum network design problems: model.. (context) - Minoux - 1989
32 On choosing a dense subgraph (context) - Kortsarz, Peleg - 1993
31 the worst-case performance of some algorithms for the asymme.. (context) - Frieze, Galbiati et al. - 1982
31 A faster approximation algorithm for the Steiner problem in .. (context) - Mehlhorn - 1988
29 Methods for designing communication networks with certain tw.. (context) - Monma, Shallcross - 1989
29 Computational results with a cutting plane algorithm for des.. (context) - Grotschel, Monma et al. - 1992
28 An efficient approximation algorithm for the survivable netw.. - Gabow, Goemans et al. - 1993
28 Ordering problems approximated: single-processor scheduling .. (context) - Ravi, Agrawal et al. - 1991
27 When cycles collapse: A general approximation technique for .. - Ravi, Klein - 1992
27 When cycles collapse: A general approximation technique for .. - Klein, Ravi - 1993
26 Approximation algorithms for minimum time broadcast - Kortsarz, Peleg - 1992
26 On finding Steiner vertices (context) - Rayward-Smith, Clare - 1986
26 Approximation algorithms for graph augmentation (context) - Khuller, Thurimella - 1993
25 Beyond Steiner's problem: A VLSI oriented generalization (context) - Reich, Widmayer - 1989
24 An SST-based algorithm for the Steiner problem in graphs (context) - Beasley - 1985
22 Prentice-Hall Inc (context) - Tanenbaum, Networks - 1981
21 How easy is local search (context) - Johnson, Papadimitriou et al. - 1988
21 The design of minimum-cost survivable networks (context) - Steiglitz, Weiner et al. - 1969
20 Improved bounds on the max-flow min-cut ratio for multicommo.. - Plotkin, Tardos - 1993
20 A dual ascent approach for Steiner tree problems on a direct.. (context) - Wong - 1984
19 Minimum-weight two-connected spanning networks (context) - Monma, Munson et al. - 1990
19 Paths, trees, and flowers (context) - Edmonds - 1965
16 Approximation algorithms for geometric embeddings in the pla.. (context) - Hansen - 1989
16 Approximating the minimum-degree Steiner tree to within one .. (context) - Furer, Raghavachari - 1992
16 Matching, Euler tours and the Chinese postman (context) - Edmonds, Johnson - 1973
16 Topological design of centralized computer networks - formul.. (context) - Gavish - 1982
15 A nearly best-possible approximation for node-weighted Stein.. (context) - Klein, Ravi - 1993
15 the problem of Steiner (context) - Melzak - 1961
15 Tough graphs and Hamiltonian circuits (context) - Chvatal - 1973
14 Approximate max-flow min-(multi) cut theorems and their appl.. - Garg, Vazirani et al. - 1993
14 The node-weighted Steiner tree problem (context) - Segev - 1987
14 A faster approximation algorithm for the Steiner problem in .. (context) - Wu, Windmayer et al. - 1986
13 Some generalizations of the Steiner problem in graphs (context) - Duin, Volgenant - 1987
13 The Power of Local Optimization: Approximation Algorithms fo.. - Lu, Ravi - 1992
13 An algorithm for the Steiner problem in the Euclidean plane (context) - Winter - 1985
13 Recognizing tough graphs is NP-hard (context) - Bauer, Hakimi et al. - 1990
13 Spanning trees with many leaves in cubic graphs (context) - Griggs, Kleitman et al. - 1989
13 Spanning trees with many leaves in cubic graphs (context) - Griggs, Kleitman et al. - 1989
12 A bound for the Steiner tree problem in graphs (context) - Plesnik - 1981
12 A new polynomial-time algorithm for linear programming (context) - Karmakar - 1984
12 Spanning trees with many leaves (context) - Kleitman, West - 1991
11 Worst-case analysis of network design problem heuristics (context) - Wong - 1980
11 Guaranteed performance heuristic for the bottleneck travelin.. (context) - Parker, Rardin - 1982
11 Constructing full spanning trees for cubic graphs (context) - Storer - 1981
11 the design of approximation algorithms for a class of graph .. (context) - Williamson - 1993
10 personal communication (context) - Berman - 1991
9 Generalized Steiner problem in series-parallel networks (context) - Winter - 1986
9 Approximation through local optimality: Designing networks w.. (context) - Ravi, Raghavachari et al. - 1992
9 The generation of minimal trees with a Steiner topology (context) - Chang - 1972
9 The point-to-point delivery and connection problems: Complex.. (context) - Li, McCormick et al. - 1992
8 Computation of Steiner minimal trees (context) - Cockayne, Schiller - 1972
8 Integer polyhedra arising from certain network design proble.. (context) - Grotschel, Monma - 1990
8 Network decomposition for the optimization of connection str.. (context) - Iwainsky, Canuto et al. - 1986
8 On linear time minor tests and depth first search - Bodlaender - 1989
8 Arbres avec un nombres maximum de sommets pendants (context) - Payan, Tchuente et al. - 1984
7 Problem reduction methods and a tree generation algorithm fo.. (context) - Balakrishnan, Patel - 1985
7 Approximating the minimum-degree spanning tree to within one.. (context) - Furer, Raghavachari - 1992
7 An approach for proving lower bounds: solution of GilbertPol.. (context) - Du, Hwang - 1990
6 Min-max results in Combinatorial Optimization (context) - Schrijver - 1983
6 Scheduling unrelated parallel machines with costs (context) - Shmoys, Tardos - 1993
6 An NC approximation algorithm for the minimum degree spannin.. (context) - Furer, Raghavachari - 1990
6 An algorithm for the Steiner problem in graphs (context) - Shore, Foulds et al. - 1982
6 Approximation algorithms for selecting network centers (Prel.. (context) - Bar-Ilan, Peleg
6 A primal-dual parallel approximation technique applied to we.. - Khuller, Vishkin et al. - 1993
6 Sur l'auto-stabilisation dans un r'eseau d'odinateurs (context) - Tchuente - 1981
5 Computing a shortest k-link path in a polygon (context) - Mitchell, Piatko et al. - 1992
5 the complexity of local search (Extended Abstract (context) - Papadimitriou, Schaffer et al. - 1990
5 Graph augmentation problems for a specified set of vertices (context) - Watanabe, Higashi et al.
4 the relationship between the biconnectivity augmentation and.. (context) - Fredrickson, Ja'Ja' - 1982
4 Simulated Annealing: Theory and Practice (context) - van Laarhoven, Aarts - 1987
4 personal communication (context) - Wolsey - 1993
4 Approximation algorithms for Steiner tree problems (context) - Sullivan - 1982
4 Remarks on Steiner minimal trees (context) - Graham, Hwang - 1976
4 Approximation algorithms for several graph augmentation prob.. (context) - Fredrickson, Ja'Ja - 1981
4 The 11/6-approximation algorithm for the Steiner problem on .. (context) - Zelikovsky
3 Some tools for approximate 3-coloring (context) - Blum - 1990
3 An improved program for the full Steiner tree problem (context) - Boyce - 1977
3 The min-max spanning tree problem and some extensions (context) - Camerini - 1978
3 The generalized Steiner problem (context) - Krarup - 1978
3 Finding Steiner forests in planar graphs (context) - Suzuki, Akama et al. - 1990
3 Probabilistic analysis of an LP relaxation bound for the Ste.. (context) - Jain - 1989
3 Communication, Transmission, and Transportation Networks (context) - Frank, Frisch - 1971
3 Methods for designing survivable communication networks (context) - Monma, Ko - 1989
3 An O(n log n) heuristic algorithm for the rectilinear Steine.. (context) - Smith, Lee et al. - 1980
3 An O(n log n) heuristic for Steiner minimal tree problems on.. (context) - Smith - 1981
2 A new bound for Euclidean Steiner minimum trees (context) - Chung, Graham - 1985
2 Approximation algorithms for the cyclecover problem with app.. (context) - Bar-Yehuda, Geiger et al. - 1993
2 A lower bound for the Steiner tree problem (context) - Chung, Hwang - 1978
2 An algorithm for transforming a spanning tree into a Steiner.. (context) - Korhonen - 1976
2 Wiley Interscience series in Disc (context) - Nemhauser, Wolsey et al. - 1988
2 Generalized Steiner problem in outerplanar graphs (context) - Winter - 1985
1 How tough is the minimum-degree Steiner tree? A new approxim.. (context) - Agrawal, Klein et al. - 1991
1 Approximation algorithms for minimum-cost k-vertex-connected.. (context) - Ravi, Williamson - 1993
1 Network Design and Network Cut Dualities: Approximation algo.. (context) - Agrawal - 1991
1 New York: North Holland (context) - Lovasz, Problems - 1979
1 The complexity of restricted minimum spanning tree problems (context) - Papadimitriou, Yannakakis - 1979
1 A new lower bound for the Steiner ratio (context) - Du, Hwang - 1983
1 a network design problem that is intractable on trees (context) - Beinstock, Marcotte - 1990
1 Linear-time algorithms for 2connected Steiner subgraph probl.. (context) - Coullard, Rais et al. - 1993
1 One heuristique pour le problem de l'arbre de Steiner (context) - El-Arbi - 1978
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