Improved Approximation Guarantees for Lower-Bounded Facility Location

DOI10.1007/978-3-642-38016-7_21zbMath1395.68332arXiv1104.3128OpenAlexW1680732213MaRDI QIDQ2848930

Chaitanya Swamy, Sara Ahmadian

Publication date: 13 September 2013

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.3128

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (11)

Combinatorial approximation algorithms for buy-at-bulk connected facility location problems ⋮ Approximation algorithms for the lower bounded correlation clustering problem ⋮ Improved bounds for metric capacitated covering problems ⋮ On coresets for fair clustering in metric and Euclidean spaces and their applications ⋮ Respecting lower bounds in uniform lower and upper bounded facility location problem ⋮ Approximate the lower-bounded connected facility location problem ⋮ On the cost of essentially fair clusterings ⋮ Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem ⋮ Faster balanced clusterings in high dimension ⋮ Approximation algorithms for the lower-bounded \(k\)-median and its generalizations ⋮ Approximation algorithms for the lower-bounded knapsack median problem

This page was built for publication: Improved Approximation Guarantees for Lower-Bounded Facility Location