1 |
F. K. Hwang, D.S. Richards and P. Winter., "The Steiner Tree Problem," Annals of Discrete Mathematics, Vol.53, North-Holland, 1992
|
2 |
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
|
3 |
김준모, "기하학적 NP-hard문제에 대한 근사접근법," 전자공학회 논문지, 제 44권 TC편 제 8월호, pp.62-67, 2007
과학기술학회마을
|
4 |
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
|
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 |
D. Z. Du and F. K. Hwang, "An approach for proving lower bounds: solution of Gilbert-Pollak conjecture on Steiner ratio," Proceedings of IEEE 31st FOCS, pp.76-85, 1990
|
7 |
M.R. Garey, R.L. Graham and D.S. Johnson, "The complexity of computing Steiner minimal trees," SIAM J, Appl. Math., 32, pp.835-859, 1977
DOI
ScienceOn
|
8 |
E.N. Gilbert and H.O. Pollak, "Steiner minimal trees," SIAM Journal on Applied Mathematics, Vol. 16, pp.1-29, 1968
DOI
ScienceOn
|