Improved approximation algorithms for multilevel facility location problems

We show that the metric multilevel facility location problem is polynomial-time reducible within a factor of 3 to the metric uncapacitated facility location problem. This leads to a combinatorial 4.83-approximation algorithm for the metric multilevel facility location problem and to a 9-approximatio...

Full description

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 30; no. 5; pp. 327 - 332
Main Author Ageev, A.A.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.10.2002
Subjects
Approximation algorithm
Facility location
Performance guarantee
Polynomial-time reduction
Facility location
Performance guarantee
Approximation algorithm
Polynomial-time reduction
Online AccessGet full text

Cover

More Information
Summary:We show that the metric multilevel facility location problem is polynomial-time reducible within a factor of 3 to the metric uncapacitated facility location problem. This leads to a combinatorial 4.83-approximation algorithm for the metric multilevel facility location problem and to a 9-approximation algorithm for a capacitated version of it.
ISSN:0167-6377
1872-7468
DOI:10.1016/S0167-6377(02)00162-1