참고문헌
- Y. F. Wu, Y. L. Xu, and G. L. Chen, "Approximation algorithms for Steiner connected dominating set," Journal of Computer Science and Technology, vol. 20, no. 5, pp. 713-716, 2005. https://doi.org/10.1007/s11390-005-0713-x
- J. MA, B. Yang, and S. Ma, "A practical algorithm for the minimum rectilinear Steiner tree," Journal of Computer Science and Technology, vol. 15, no. 1, pp. 96-99, 2000. https://doi.org/10.1007/BF02951931
- A. Gupta and M. Pal, "Stochastic Steiner trees without a root," in Automata, Languages, and Programming. Heidelberg: Springer, 2005, pp. 1051-1063.
- V. Melkonian, "New primal-dual algorithms for Steiner tree problem," Journal of Computers and Operations Research, vol. 34, no. 7, pp. 2147-2167, 2007. https://doi.org/10.1016/j.cor.2005.08.009
- M. Hauptmann, "On the approximability of dense Steiner problems," Journal of Discrete Algorithms, vol. 21, pp. 41-51, 2013. https://doi.org/10.1016/j.jda.2013.06.005
- D. Skorin-Kapov and J. Skorin-Kapov, "A note on Steiner tree games," Journal of Networks, vol. 59, no. 2, pp. 215-225, 2012. https://doi.org/10.1002/net.20436
- J. Byrka, F. Grandoni, T. RothvoB, and L. Sanita, "An improved LP-based approximation for Steiner tree," in Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC), Cambridge, MA, 2010, pp. 583-592.
- M. Brazil, C. J. Ras, K. J. Swanepoel, and D. A. Thomas, "Generalised k-Steiner tree problems in normed planes," in Computing Research Repository, 2011 [Online]. Available: http://arxiv.org/pdf/1111.1464v1.pdf.
- G. Georgakopoulos and C. H. Papadimitriou, "The 1-Steiner tree problem," Journal of Algorithms, vol. 8, no. 1, pp. 122-130, 1987. https://doi.org/10.1016/0196-6774(87)90032-0
- A. K. Abu-Affash, P. Carmi, and M. J. Katz, "Bottleneck Steiner tree with bounded number of Steiner vertices," in Proceedings of 23rd Canadian Conference on Computational Geometry, Toronto, 2011, pp. 355-366.
- S. Noferesti and H. Shah-Hosseini, "A hybrid algorithm for solving Steiner tree problem," International Journal of Computer Applications, vol. 41, no. 5, pp. 14-20, 2012. https://doi.org/10.5120/5536-7584
- F. Grandoni, "On min-power Steiner tree," in Proceedings of 20th Annual European Symposium on Algorithms (ESA), Ljubljana, Slovenia, 2012, pp. 527-538.
- B. Bollobas, D. Gamarnik, O. Riordan, and B. Sudakov, "On the value of a random minimum weight Steiner tree," Combinatorica, vol. 24, no. 2, pp. 187-207, 2004. https://doi.org/10.1007/s00493-004-0013-z
- L. Kucera, A. Marchetti-Spaccamela, M. Protasi, and M. Talamo, "Near optimal algorithms for finding minimum Steiner trees on random graphs," in Mathematical Foundations of Computer Science. Heidelberg: Springer, 1986, pp. 501-511.
- A. Segev, "The node-weighted Steiner tree problem," Networks, vol. 17, no.1, pp. 1-17, 1987. https://doi.org/10.1002/net.3230170102