참고문헌
- D.Z, Du and F.K. Hwang, 'An Approach for Providing Lower Bounds; Solution of Gilbert-Pollak Conjecture on Steiner Ratio', Proceedings of IEEE 31sy FOCS, pp.76-85, 1990 https://doi.org/10.1109/FSCS.1990.89526
- G.L. Xue, G.H. Lin and D.Z. Du, 'Grade of Service Steiner Minimum Trees in Euclidean Plane', Algorithmica, Vol.31, pp.479-500, 2001 https://doi.org/10.1007/s00453-001-0050-6
- J. Kim and I. Kim, 'Approximation Ratio 2 for the Minimum Number of Steiner Points', Journal of KISS, pp.387-396, 2003
- J. Kim, M. Cardei, I. Cardei and X. Jia, 'A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem', Algorithrnica, Vol.42, pp.109-120, 2005
- S. Arora, 'Polynomial-Time Approximation Schemes for Euclidean TSP and Other Geometric Problems', Proceeding of 37th IEEE Symposium on Foundations of Computer Science, pp.2-12, 1996 https://doi.org/10.1109/SFCS.1996.548458
- T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 2nd Ed., MIT Press, 2001
- E.J. Cockayne and D.E. Hewgrill, 'Exact Computation of Steiner Minimal Trees in the Plane', Information Processing Letters, Vol.22, pp.151-156, 1986 https://doi.org/10.1016/0020-0190(86)90062-1
- E.J. Cockayne and D.E. Hewgrill, 'Improved Computation of Plane Steiner Minimal Tree', Algorithrnica, Vol.7, pp.219-229, 1992 https://doi.org/10.1007/BF01758759
- F.K. Hwang, 'A Primer of the Euclidean Steiner problem', Annals of Operations Research, Vol.33, pp.73-84, 1991 https://doi.org/10.1007/BF02061658
- F.K Hwang, D.S. Richards and P. Wmter, 'The Steiner Tree Problem', Annals of Discrete Mathematics, Vol.53, North-Holland, 1992
- M.J. Smith and B. Toppur, 'Euclidean Steiner Minimal Trees, Minimum Energy Configurations and the Embedding Problem of Weighted Graph in E3', Discrete Applied Mathematics, Vol.71, pp.187-215, 1997 https://doi.org/10.1016/S0166-218X(96)00064-9
- P. Winter, 'An Algorithm for the Steiner Problem in the Euclidean Plane', Networks, Vol.15, pp.323-345, 1985 https://doi.org/10.1002/net.3230150305
- I. Kim, C. Kim and S.H. Hosseini, 'A Heuristic Using GOSST with 2 Connecting Strategies for Minimum Construction Cost of Network', International Journal of Computer Science and Network Security, Vol.6, No.12, pp.60-72, 2006
- I. Kim and C. Kim, 'An Enhanced Heuristic Using Direct Steiner Point Locating and Distance Preferring MST Building Strategy for GOSST Problem', International Journal of Computer Science and Network Security, Vol.7, No.2, pp.164-175, 2007
- A. Balakrishnan, T.L. Nagnanti and P. Mirchandani, 'Modeling and Heuristic Worst Case Performance Analysis of the Two Level Network Design Problem', Management Science, Vol.40, pp.846-867, 1994 https://doi.org/10.1287/mnsc.40.7.846
- C. Duin and A. Volgenant, 'The Multi-weighted Steiner Tree Problem', Annals of Operations Research, Vol.33, pp.451-469, 1991 https://doi.org/10.1007/BF02071982
- G.H. Lin and G.L. Xue , 'Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-length', Information Processing Letters, pp.53-57, 1999 https://doi.org/10.1016/S0020-0190(98)00201-4
- J.R Current, C.S. Revelle and J.L. Cohon, 'The Hierarchical Network Design Problem', European Journal of Operational Research, Vol.27, pp.57-66, 1986 https://doi.org/10.1016/S0377-2217(86)80007-8
- P. Mirchandani, 'The Multi-tier Tree Problem', INFORMS Journal on Computing, Vol.8, pp.202~218, 1996 https://doi.org/10.1287/ijoc.8.3.202
- P. Winter and M. Zachariasen, 'Large Euclidean Steiner Minimum Trees: An Improved Exact Algorithm', Networks, Vol.30, pp.149-166, 1998