10870

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

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

102

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

30

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

34

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

344

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

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

71

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

35

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

34

Topological Design of Centralized Computer Networks: Formulations and Algorithms
– B Gavish
 1982

100

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

7

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

162

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