Algorithms - ESA 2003
From MaRDI portal
Publication:5897264
DOI10.1007/b13632zbMath1266.90119OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897264
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Related Items (28)
Combinatorial approximation algorithms for the robust facility location problem with penalties ⋮ New approximation algorithms for the unsplittable capacitated facility location problem ⋮ Approximation algorithms for hard capacitated \(k\)-facility location problems ⋮ Integrality gaps for strengthened linear relaxations of capacitated facility location ⋮ A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties ⋮ Approximation algorithms for facility location problems with a special class of subadditive cost functions ⋮ LP-based approximation for uniform capacitated facility location problem ⋮ A note on LP-based approximation algorithms for capacitated facility location problem ⋮ A 3-approximation algorithm for the facility location problem with uniform capacities ⋮ An approximation algorithm for the \(k\)-level capacitated facility location problem ⋮ Capacitated covering problems in geometric spaces ⋮ Approximation algorithms for prize-collecting capacitated network design problems ⋮ Improved approximation algorithm for universal facility location problem with linear penalties ⋮ \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space ⋮ Respecting lower bounds in uniform lower and upper bounded facility location problem ⋮ Capacitated Domination Problem ⋮ LP-based approximation algorithms for capacitated facility location ⋮ From stars to comets: improved local search for universal facility location ⋮ Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding ⋮ Local search algorithm for universal facility location problem with linear penalties ⋮ Local search algorithms for the red-blue median problem ⋮ Capacitated domination problem ⋮ An approximation algorithm for a facility location problem with stochastic demands and inventories ⋮ Unnamed Item ⋮ Approximation algorithms for the transportation problem with market choice and related models ⋮ A 6.55 factor primal-dual approximation algorithm for the connected facility location problem ⋮ Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem ⋮ Improved local search for universal facility location
This page was built for publication: Algorithms - ESA 2003
