Assignment problem in content distribution networks

DOI10.1145/2229163.2229164zbMath1295.68207OpenAlexW2129486506MaRDI QIDQ3189061

MohammadHossein Bateni, Mohammad Taghi 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

networkapproximation algorithmfacility locationPTAS

Mathematics Subject Classification ID

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

Related Items (6)

New approximation algorithms for the unsplittable capacitated facility location problem ⋮ Integrality gaps for strengthened linear relaxations of capacitated facility location ⋮ Euclidean prize-collecting Steiner forest ⋮ Local search algorithms for the red-blue median problem ⋮ Improved approximation for prize-collecting red-blue median ⋮ A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions

This page was built for publication: Assignment problem in content distribution networks