1 |
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.
DOI
|
2 |
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.
|
3 |
A. Segev, "The node-weighted Steiner tree problem," Networks, vol. 17, no.1, pp. 1-17, 1987.
DOI
|
4 |
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.
DOI
|
5 |
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.
|
6 |
A. Gupta and M. Pal, "Stochastic Steiner trees without a root," in Automata, Languages, and Programming. Heidelberg: Springer, 2005, pp. 1051-1063.
|
7 |
V. Melkonian, "New primal-dual algorithms for Steiner tree problem," Journal of Computers and Operations Research, vol. 34, no. 7, pp. 2147-2167, 2007.
DOI
|
8 |
M. Hauptmann, "On the approximability of dense Steiner problems," Journal of Discrete Algorithms, vol. 21, pp. 41-51, 2013.
DOI
|
9 |
D. Skorin-Kapov and J. Skorin-Kapov, "A note on Steiner tree games," Journal of Networks, vol. 59, no. 2, pp. 215-225, 2012.
DOI
|
10 |
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.
|
11 |
G. Georgakopoulos and C. H. Papadimitriou, "The 1-Steiner tree problem," Journal of Algorithms, vol. 8, no. 1, pp. 122-130, 1987.
DOI
|
12 |
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.
|
13 |
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.
DOI
|
14 |
F. Grandoni, "On min-power Steiner tree," in Proceedings of 20th Annual European Symposium on Algorithms (ESA), Ljubljana, Slovenia, 2012, pp. 527-538.
|
15 |
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.
DOI
|