Approximation Algorithms for Data Placement Problems

DOI10.1137/080715421zbMath1175.68558OpenAlexW2018682510MaRDI QIDQ3395037

Rajmohan Rajaraman, Chaitanya Swamy, Ivan D. Baev

Publication date: 20 August 2009

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d513cc6d469f3dcd858fde136a68fd4fea7b756c

zbMATH Keywords

linear programmingfacility locationapproximation algorithmsdata placement

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (14)

New approximation results for resource replication problems ⋮ An improved approximation algorithm for squared metric \(k\)-facility location ⋮ Exact approaches for static data segment allocation problem in an information network ⋮ Better guarantees for \(k\)-median with service installation costs ⋮ The Euclidean k-Supplier Problem ⋮ Approximation algorithms and heuristics for task scheduling in data‐intensive distributed systems ⋮ Optimal data placement on networks with a constant number of clients ⋮ Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding ⋮ Facility location models to locate data in information networks: a literature review ⋮ A unified framework of FPT approximation algorithms for clustering problems ⋮ Facility location with red-blue demands ⋮ Cache me if you can: capacitated selfish replication games in networks ⋮ Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks ⋮ Improved approximation algorithms for solving the squared metric \(k\)-facility location problem

This page was built for publication: Approximation Algorithms for Data Placement Problems