219

When trees collide: An approximation algorithm for the generalized Steiner problem on networks
– Ajit Agrawal, Philip Klein, R. Ravi
 1994

81

A primaldual approximation algorithm for generalized Steiner network problems
– David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vaziran
 1995

67

A note on the prize collecting traveling salesman problem
– Daniel Bienstock, Michel X. Goemans, David SimchiLevi, David Williamson
 1993

80

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 twoconnectivity problems
– R. Ravi, R. Ravi, Philip Klein, Philip Klein
 1993

95

The prize collecting traveling salesman problem
– E Balas
 1989

47

A constantfactor approximation algorithm for the kMST problem
– Joseph S. B. Mitchell
 1996

78

A 3approximation for the minimum tree spanning k vertices
– N Garg
 1996

53

Improved Approximation Guarantees for MinimumWeight kTrees And PrizeCollecting Salesmen
– Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala
 1994

50

An Efficient Approximation Algorithm for the Survivable Network Design Problem
– Harold N. Gabow, Michel X. Goemans , David P. Williamson
 1993

44

Survivable networks, linear programming relaxations and the parsimonious property
– Michel X. Goemans, Dimitris J. Bertsimas
 1993

247

A fast algorithm for Steiner trees
– L Kou, G Markowsky, L Berman
 1981

225

An approximate solution for the Steiner problem in graphs
– H Takahashi, A Matsuyama
 1980

57

The computation of nearly minimal Steiner trees in graphs
– V RaywardSmith
 1983

10988

Computers and Intractability: A Guide to the Theory of NPcompleteness
– M Garey, D Johnson
 1979

8557

R.: Introduction to Algorithms
– T Cormen, C Leiserson, Rivest
 1990

9

A scaling technique for better network design
– N Garg
 1994

236

Multiterminal network flows
– R E Gomory, T C Hu
 1961

390

On the hardness of approximating minimization problems
– C Lund, M Yannakakis
 1994
