✦ LIBER ✦

A new approximation algorithm for the -facility location problem

✍ Scribed by Peng Zhang

Book ID: 108281333
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 405 KB
Volume: 384
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.05.024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new approximation algorithm for the mu

A new approximation algorithm for the multilevel facility location problem

✍ Adriana F. Gabor; Jan-Kees C.W. van Ommeren 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 969 KB

Approximation algorithms for connected f

Approximation algorithms for connected facility location problems

✍ Mohammad Khairul Hasan; Hyunwoo Jung; Kyung-Yong Chwa 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 401 KB

Approximation Algorithms for Bounded Fac

Approximation Algorithms for Bounded Facility Location Problems

✍ Piotr Krysta; Roberto Solis-Oba 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 92 KB

Approximate algorithms for the competiti

Approximate algorithms for the competitive facility location problem

✍ V. L. Beresnev; A. A. Mel’nikov 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 552 KB

An approximation algorithm for the -leve

An approximation algorithm for the -level stochastic facility location problem

✍ Zhen Wang; Donglei Du; Adriana F. Gabor; Dachuan Xu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 268 KB

We consider the k-level stochastic facility location problem. For this, we present an LP rounding algorithm that is 3-approximate. This result is achieved by a novel integer linear programming formulation that exploits the stochastic structure.

An approximation algorithm for thek-leve

An approximation algorithm for thek-level capacitated facility location problem

✍ Donglei Du; Xing Wang; Dachuan Xu 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 302 KB