1 |
Z.A. Melzak, "On the problem of Steiner," Canadian Mathematics Bulletin, Vol. 4, pp. 143-148, 1961.
DOI
|
2 |
Ding-Zhu Du, Ker-I Ko, Theory of Computational Complexity, Wiley Inter-Science 2000.
|
3 |
Michael R. Garey, David S. Johnson, Computers and Intractability A Guide to the Theory of NP-Completeness, Freeman, 1978.
|
4 |
S. Arora, "Polynomial-time approximation schemes for Euclidean TSP and other geometric problems," Proc. 37th IEEE Symp. on Foundations of Computer Science, pp. 2-12, 1996.
|
5 |
S. Arora, "Nearly linear time approximation schemes for Euclidean TSP and other geometric problems," Proc. 38th IEEE Symp. on Foundations of Computer Science, pp. 554-563, 1997.
|
6 |
DING-ZHU DU, FRANK K. HWANG and GUOLIANG XUE. "Interconnecting Highways," SIAM Discrete Mathematics, Vol. 12, pp. 252-261, 1999.
DOI
|
7 |
E.N. Gilbert and H.O. Pollak, "Steiner minimal trees," SIAM Journal on Applied Mathematics, Vol. 16, pp.1-29, 1968.
DOI
ScienceOn
|
8 |
X. Cheng, J.-M. Kim and B. Lu, "A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways," Journal of Combinatorial Optimization, Vol 5, issue 3, pp. 327-343, 2001.
DOI
ScienceOn
|