1 |
A. Zelikovsky, "Better approximation bounds for the networks and euclidean steiner tree problems," In Technical Report, 1996
|
2 |
R. Hwang, D. Richards et al, "The steiner tree problem," Annals of Discrete Mathematics, 53, 1992
|
3 |
P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with guaranteed delivery in ad-hoc wireless networks," Wireless Netw., Vol.7, No.6, pp.609-616, 2001
DOI
ScienceOn
|
4 |
J. E. Beasley, "A heuristic for euclidean and rectilinear steiner problems," EJOR. 58:284-292, 1992
DOI
ScienceOn
|
5 |
M. Mauve. H. Fübler et al. "Position based Multicast Routing for Mobile Ad-hoc Networks" ACM SIGMOBILE Mobile Computing and Communications Vol.7 Issue 3, July 2003.
|
6 |
J. Sanchez, P. Ruiz, X. Liu, and I. Stojmenovic, "GMR: Geographic Multicast Routing for Wireless Sensor networks," in Proc. of IEEE SECON, 2006
|
7 |
S. Wu and K. S. Candan, "Gper: Geographic power efficient routing in sensor netwroks," in ICNP. pp.161-172, 2004
|
8 |
M. Minoux, "Efficient greedy heuristics for steiner tree problems using reoptimization and supermodularity," INFOR, 28:221-233, 1990
|
9 |
M. Zachariasen and P. Winter, "Concatenationbased greedy heuristics for the euclidean steiner tree problem," Algorithmica, 25: 418-437, 1999
DOI
ScienceOn
|
10 |
G. Robins and A. Zelikovsky, "Improved steiner tree approximation in graphs," In Proc. Symposium on Discrete Algorithms, 2000
|