Author:
Su Ke,Lu Bing,Ngo Huang,Pardalos Panos M.,Du Ding-Zhu
Publisher
Springer International Publishing
Reference98 articles.
1. Alfaro M, Conger M, Hodges K, Levy A, Kochar R, Kuklinski L, Mahmood Z, von Haam K (1991) The structure of singularities of phi;-minimizing networks in R2. Pacific J Math 149:201–210
2. Alon N, Azar Y (1993) On-line Steiner trees in the Euclidean plane. Discrete Comput Geom 10(2): 113–121
3. Arora S (1996) Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedingd of the 37th FOCS, pp 2–12
4. Arora V, Santosh V, Saran H, Vazirani V (1994) A limited-backtrack greedy schema for approximation algorithms. Manuscript
5. Beasley JE (1989) A heuristic for the Euclidean and rectilinear Steiner problems. Techn Report Managem School Imperial College London