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

MaRDI QIDQ4633893zbMATH OpenFDO

Authors MohammadHossein Bateni, Mohammad T. Hajiaghayi

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496858

Mathematics Subject Classification ID

Combinatorial optimization (90C27) 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
• Approximation algorithms for hard capacitated \(k\)-facility location problems

Cited in

(5)

• Assignment problem in content distribution networks, unsplittable hard-capacitated facility location
• Growing half-balls: minimizing storage and communication costs in CDNs
• A distributed transportation simplex applied to a Content Distribution Network problem
• Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
• New approximation algorithms for the unsplittable capacitated facility location 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 Q4633893)