49

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

55

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

10988

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

102

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

31

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

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

190

On constructing minimum spanning trees in k−dimensional space and related problems
– A C Yao
 1982

74

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

8557

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

35

Topological design of Centralized Computer Networks  formulations and algorithms
– B Gavish
 1982

100

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

34

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

11

Euclidean spanner graphs with degree four
– J S Salowe
 1994

165

Guillotine subdivisions approximate polygonal subdivisions: Part II  A simple polynomialtime approximation scheme for geometric kMST, TSP, and related problems
– Joseph S. B. Mitchell
 1996

138

On Steiner's problem with rectilinear distance
– M HANAN

355

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

23

An o(n log n) algorithm for rectilinear minimal spanning trees
– F K Hwang
 1979

9

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

104

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