Assignment problem in content distribution networks, unsplittable hard-capacitated facility location

DOI10.1145/2229163.2229164MaRDI QIDQ3189061zbMATH OpenOpenAlexFDO

Authors MohammadHossein Bateni, Mohammad T. Hajiaghayi

Publication date 9 September 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2229163.2229164

zbMATH Keywords

approximation algorithmfacility locationnetworkPTAS

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
• New approximation algorithms for the unsplittable capacitated facility location problem
• New approximation algorithms for the unsplittable capacitated facility location problem
• LP-based approximation algorithms for capacitated facility location
• Integer Programming and Combinatorial Optimization

Cited in

(10)

• Improved approximation for prize-collecting red-blue median
• Euclidean prize-collecting Steiner forest
• New approximation algorithms for the unsplittable capacitated facility location problem
• Integrality gaps for strengthened linear relaxations of capacitated facility location
• Growing half-balls: minimizing storage and communication costs in CDNs
• Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
• A branch-and-price algorithm for facility location with general facility cost functions
• A distributed transportation simplex applied to a Content Distribution Network problem
• Airports and railways with unsplittable demand
• Local search algorithms for the red-blue median problem

This page was built for publication: Assignment problem in content distribution networks, unsplittable hard-capacitated facility location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189061)