10964

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

49

On two geometric problems related to the traveling salesman problem
– C H Papadimitriou, U V Vazirani
 1984

56

Transitions in geometric minimum spanning trees
– C L Monma, S Suri
 1992

103

An 11/6approximation algorithm for the network Steiner problem
– A Zelikovsky
 1993

138

On Steiner’s problem with rectilinear distance
– M Hanan
 1966

42

Approximations for Steiner trees with minimum number of Steiner points
– Donghui Chen, D.Z. Du, Xiaodong Hu , Guohui Lin , Lusheng Wang , Guoliang Xue
 2001

34

New Algorithms for the Rectilinear Steiner Tree Problem
– J M Ho, G Vijayan, C K Wong
 1990

30

Low Degree Spanning Trees Of Small Weight
– Samir Khuller, Balaji Raghavachari, Neal Young
 1996

349

A general approximation technique for constrained forest problems
– Michel X. Goemans, David P. Williamson
 1995

9

Knotengrade kürzester Bäume in endlichdimensionalen Banachräumen
– D Cieslik
 1990

96

A nearly bestpossible approximation algorithm for nodeweighted Steiner trees
– Philip Klein, R. Ravi
 1993

72

Approximating the minimumdegree Steiner tree to within one of optimal
– Balaji Raghavachari
 1994

35

Topological design of centralized computer networks formulations and algorithms
– B Gavish
 1982

35

Steiner tree problem with minimum number of steiner points and bounded edgelength
– G Lin, G Xue
 1999

101

Improved approximations for the Steiner tree problem
– P Berman, V Ramaiyer
 1994

8

A note on the MST heuristic for bounded edgelength Steiner Trees with minimum number of Steiner Points
– Ion I. Mandoiu, Alexander Z. Zelikovsky
 1999

349

The Steiner Tree Problem
– F K Hwang, D S Richards, P Winter
 1992

11

Euclidean spanner graphs with degree four
– J S Salowe
 1994

10

Solving rectilinear steiner tree problems exactly in theory and practice
– Ulrich Fössmeier, Michael Kaufmann
