Approximations for node-weighted Steiner tree in unit disk graphs

Optimization Letters

Volumn 4, Issue 3, 2010, Pages 405-416

  Xu, X ^a   Wang, Y ^b   Du, H ^a   Wan, P J ^a   Zou, F ^c   Li, X ^d   Wu, W ^c  

^a Illinois Institute of Technology   (United States)

^b TSINGHUA UNIVERSITY   (China)

^c The University of Texas at Dallas   (United States)

^d LANZHOU UNIVERSITY   (China)

Author keywords

Approximation algorithm; Node weighted Steiner tree; Unit disk graph

Indexed keywords

APPROXIMATION BOUNDS; CONNECTED GRAPH; GENERAL GRAPH; GREEDY ALGORITHMS; LECTURE NOTES; SET COVER; STEINER TREE PROBLEM; STEINER TREES; UNIT DISK GRAPHS; WEIGHTED GRAPH;

BEVERAGES; DISKS (STRUCTURAL COMPONENTS); TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS;

EID: 77956258799     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-010-0194-x     Document Type: Article

References (11)

1. Borchers A., Du D.-Z.: The k-Steiner ratio in graphs. SIAM J. Comput. 26(3), 857-869 (1997).
2. Berman P., Ramaiyer V.: Improved approximations for the Steiner tree problem. J. Algorithms 17(3), 381-408 (1994).
3. Gröpl C., Hougardy S., Nierhoff T., Prömel H. J.: Approximation algorithms for the Steiner tree problem in graphs. In: Cheng, X., Du, D.-Z. (eds) Steiner trees in Industry, pp. 235-279. Kluwer, Dordrecht (2001).
4. Guha S., Khuller S.: Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inf. Comput. 150(1), 57-74 (1999).
5. Klein P., Ravi R.: A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms 19(1), 104-115 (1995).
6. Papadimitriou C. H., Vazirani U. V.: On two geometric problems relating to the traveling salesman problem. J. Algorithms 5, 231-246 (1984).
7. Robins G., Zelikovsky A.: Tighter bounds for graph Steiner tree approximation. SIAM J. Discrete Math. 19(1), 122-134 (2005).
8. Wan, P.-J., Du, D.-Z., Pardalos, P., Wu, W.: Greedy approximations for minimum submodular cover with submodular cost. Comput. Optim. Appl. (2009) (to appear).
9. Zelikovsky A.: The 11/6-approximation algorithm for the Steiner problem on networks. Algorithmica 9, 463-470 (1993).
10. Zelikovsky, A.: Better approximation bounds for the network and Euclidean Steiner tree problems. Technical Report CS-96-06, Department of Computer Science, University of Virginia (1996).
11. Zou, F., Li, X., Kim, D., Wu, W.: Two Constant Approximation Algorithms for Node-Weighted Steiner tree in Unit Disk Graphs. Lecture Notes in Computer Science, vol. 5165, pp. 278-285. COCOA (2008).