A note on LP-based approximation algorithms for capacitated facility location problem

DOI10.1016/j.tcs.2022.08.002OpenAlexW4293472980WikidataQ114129041 ScholiaQ114129041MaRDI QIDQ2172603

Runjie Miao, Jinjiang Yuan

Publication date: 16 September 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.08.002

zbMATH Keywords

approximation algorithmlinear programcapacitated facility location problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• A 3-approximation algorithm for the facility location problem with uniform capacities
• LP-based approximation algorithms for capacitated facility location
• Improved approximation algorithms for the facility location problems with linear/submodular penalties
• Improved approximation algorithms for capacitated facility location problems
• Improved local search for universal facility location
• Improved approximation algorithm for universal facility location problem with linear penalties
• A 5-Approximation for Capacitated Facility Location
• LP-Based Algorithms for Capacitated Facility Location
• Analysis of a Local Search Heuristic for Facility Location Problems
• Algorithms - ESA 2003

This page was built for publication: A note on LP-based approximation algorithms for capacitated facility location problem