|
195
|
When trees collide: An approximation algorithm for the generalized Steiner problem on networks
– Ajit Agrawal, Philip Klein, R. Ravi
- 1994
|
|
73
|
A primal-dual approximation algorithm for generalized Steiner network problems
– David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vaziran
- 1995
|
|
65
|
Improved Approximation Algorithms for Network Design Problems
– M. X. Goemans, A.V. Goldberg, S. A. Plotkin, D.B. Shmoys, E. Tardos, D. P. Williamson
- 1994
|
|
31
|
When cycles collapse: A general approximation technique for constrained two-connectivity problems
– R. Ravi, R. Ravi, Philip Klein, Philip Klein
- 1993
|
|
52
|
A note on the prize collecting traveling salesman problem
– Daniel Bienstock, Michel X. Goemans, David Simchi-Levi, David Williamson
- 1993
|
|
42
|
Survivable networks, linear programming relaxations and the parsimonious property
– Michel X. Goemans, Dimitris J. Bertsimas
- 1993
|
|
215
|
A Fast Algorithm for Steiner Trees
– L Kou, G Markowsky, L Berman
- 1981
|
|
197
|
Multi-terminal network flows
– R E Gomory, T Hu
- 1961
|
|
50
|
An Efficient Approximation Algorithm for the Survivable Network Design Problem
– Harold N. Gabow, Michel X. Goemans , David P. Williamson
- 1993
|
|
187
|
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
– Moses Charikar, Sudipto Guha
- 1999
|
|
67
|
Biconnectivity Approximations and Graph Carvings
– Samir Khuller, Uzi Vishkin
- 1994
|
|
56
|
Approximation algorithms for several graph augmentation problems
– G N Frederickson, J Ja'Ja'
- 1981
|
|
91
|
Improved approximations for the Steiner tree problem
– P Berman, V Ramaiyer
- 1994
|
|
54
|
The computation of nearly minimal Steiner trees in graphs
– V J Rayward-Smith, A R Clare
- 1983
|
|
209
|
An approximate solution for the Steiner problem in graphs
– H Takahashi, A Matsuyama
- 1980
|
|
8882
|
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H
– M R Garey, D S Johnson
- 1979
|
|
7324
|
Cache-oblivious algorithms
– M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN
- 1999
|
|
66
|
A faster approximation algorithm for the Steiner problem in graphs
– K Mehlhorn
- 1988
|
|
38
|
A constant-factor approximation algorithm for the k-MST problem
– Joseph S. B. Mitchell
- 1996
|
