Approximation algorithms for soft-capacitated facility location in capacitated network design

Algorithmica (New York)

Volumn 53, Issue 3, 2009, Pages 263-297

  Chen, Xujin ^a   Chen, Bo ^b  

^a INSTITUTE OF APPLIED MATHEMATICS   (China)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Approximation algorithm; Facility location; Network design; Performance guarantee; Soft capacity

Indexed keywords

APPROXIMATE ALGORITHMS; BUY AT BULKS; CABLE INSTALLATIONS; CAPACITATED NETWORK DESIGNS; CAPACITY CONSTRAINTS; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; DIVERSE APPLICATIONS; FACILITY LOCATION; LA-GRANGIAN RELAXATIONS; MAX SNP-HARD; MINIMUM COSTS; NETWORK CONNECTIVITIES; NETWORK DESIGN; PERFORMANCE GUARANTEE; POLYNOMIAL-TIME; PRIMAL DUALS; RUNNING TIME; SERVICE PROVISIONS; SOFT CAPACITY;

CABLES; COMBINATORIAL MATHEMATICS; DESIGN; FACILITIES; INSTALLATION; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 61349192241     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9032-7     Document Type: Article

References (14)

1. A. Agrawal P. Klein R. Ravi 1995 When trees collide: an approximation algorithm for the generalized Steiner problem on networks SIAM J. Comput. 23 440 456
2. Drezner, Z., Hamacher, H.W. (eds.): Facility Location: Applications and Theory. Springer, Berlin (2002)
3. M.X. Goemans D.P. Williamson 1995 A general approximation techniques for constrained forest problems SIAM J. Comput. 24 296 317
4. S. Guha S. Khuller 1999 Greedy strikes back: improved facility location algorithms J. Algorithms 31 228 248
5. R. Hassin R. Ravi F.S. Salman 2004 Approximation algorithms for a capacitated network design problem Algorithmica 38 417 431
6. K. Jain V.V. Vazirani 2001 Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation J. ACM 48 274 296
7. Krick, C., Racke, H., Westermann, M.: Approximation algorithms for data management in networks. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 237-246 (2001)
8. M. Mahdian Y. Ye J. Zhang 2006 Approximation algorithms for metric facility location problems SIAM J. Comput. 36 411 432
9. Meyerson, A., Munagala, K., Plokin, S.: Cost-distance: two metric network design. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 624-630 (2000)
10. R. Ravi A. Sinha 2006 Approximation algorithms for problems combining facility location and network design Oper. Res. 54 73 81
11. Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 770-779 (2000)
12. Sanso, B., Soriano, P. (eds.): Telecommunications Network Planning. Kluwer Academic, Dordrecht (1999)
13. C. Swamy A. Kumar 2004 Primal-dual algorithms for connected facility location Algorithmica 40 245 268
14. Vazirani, V.V.: Approximation Algorithms. Springer, New York (2002)