On Facility Location with General Lower Bounds

DOI10.1137/1.9781611975482.138zbMath1432.68580arXiv1805.02244OpenAlexW2799689005MaRDI QIDQ5236325

Shi Li

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (8)

Approximation algorithms for the lower bounded correlation clustering problem ⋮ Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center ⋮ Respecting lower bounds in uniform lower and upper bounded facility location problem ⋮ Approximate the lower-bounded connected facility location problem ⋮ Unnamed Item ⋮ Approximation algorithms for the lower-bounded \(k\)-median and its generalizations ⋮ Approximation algorithms for the lower-bounded knapsack median problem ⋮ An approximation algorithm for stochastic multi-level facility location problem with soft capacities

This page was built for publication: On Facility Location with General Lower Bounds