Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks

DOI10.1137/16M1103014zbMath1398.68658OpenAlexW2885940517WikidataQ129478122 ScholiaQ129478122MaRDI QIDQ4578010

Shay Kutten, Erez Kantor, Dror Rawitz, Reuven Bar Yehuda

Publication date: 7 August 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/16m1103014

zbMATH Keywords

approximation algorithmonline algorithmcontent delivery networkonline Steiner tree

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information storage and retrieval of data (68P20) Approximation algorithms (68W25) Internet topics (68M11) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-line Steiner trees in the Euclidean plane
• Competitive algorithms for distributed data management.
• Polynomial time approximation scheme for symmetric rectilinear Steiner arborescence problem
• Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem
• Dynamic Steiner Tree Problem
• The Complexity of Computing Steiner Minimal Trees
• Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems
• Competitive distributed file allocation
• Steiner Tree Approximation via Iterative Randomized Rounding
• Steiner tree problems

This page was built for publication: Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks