A 1.488 approximation algorithm for the uncapacitated facility location problem

We present a 1.488-approximation algorithm for the metric uncapacitated facility location (UFL) problem. Previously, the best algorithm was due to Byrka (2007). Byrka proposed an algorithm parametrized by γ and used it with γ≈1.6774. By either running his algorithm or the algorithm proposed by Jain,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information and computation Ročník 222; s. 45 - 58
Hlavní autor: Li, Shi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.01.2013
Témata:
Approximation
Facility location problem
Theory
Facility location problem
Theory
Approximation
ISSN:0890-5401, 1090-2651
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We present a 1.488-approximation algorithm for the metric uncapacitated facility location (UFL) problem. Previously, the best algorithm was due to Byrka (2007). Byrka proposed an algorithm parametrized by γ and used it with γ≈1.6774. By either running his algorithm or the algorithm proposed by Jain, Mahdian and Saberi (STOCʼ02), Byrka obtained an algorithm that gives expected approximation ratio 1.5. We show that if γ is randomly selected, the approximation ratio can be improved to 1.488. Our algorithm cuts the gap with the 1.463 approximability lower bound by almost 1/3.
ISSN:0890-5401
1090-2651
DOI:10.1016/j.ic.2012.01.007