Approximation Algorithms for Data Placement Problems

DOI10.1137/080715421MaRDI QIDQ3395037zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmsdata placementfacility locationlinear programming

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1445307
• Approximation algorithms for data placement in arbitrary networks
• Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
• Approximation algorithms for data management in networks
• scientific article; zbMATH DE number 1670526
• The subset assignment problem for data placement in caches
• The subset assignment problem for data placement in caches
• The hardness of cache conscious data placement
• The hardness of cache conscious data placement

Cited in

(32)

• Joint object placement and node dimensioning for internet content distribution
• Distributed backup placement in networks
• Facility location with red-blue demands
• Approximation algorithms for data management in networks
• Improved approximation algorithms for solving the squared metric k-facility location problem
• An improved approximation algorithm for squared metric \(k\)-facility location
• Cache me if you can: capacitated selfish replication games in networks
• Replica placement on bounded treewidth graphs
• Optimal data placement on networks with a constant number of clients
• Cache placement in sensor networks under an update cost constraint
• Better guarantees for \(k\)-median with service installation costs
• New approximation results for resource replication problems
• Approximation algorithms for data placement in arbitrary networks
• Bandwidth constrained placement in a WAN
• scientific article; zbMATH DE number 2089325 (Why is no real title available?)
• The hardness of cache conscious data placement
• Exact approaches for static data segment allocation problem in an information network
• Minimal cost reconfiguration of data placement in storage area network
• Approximation schemes for generalized two-dimensional vector packing with application to data placement
• scientific article; zbMATH DE number 569959 (Why is no real title available?)
• Approximation algorithms and heuristics for task scheduling in data-intensive distributed systems
• The subset assignment problem for data placement in caches
• Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
• scientific article; zbMATH DE number 1445307 (Why is no real title available?)
• The Euclidean k-supplier problem
• Facility location models to locate data in information networks: a literature review
• The hardness of cache conscious data placement
• Online social network data placement over clouds
• Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
• A unified framework of FPT approximation algorithms for clustering problems
• Improved approximation algorithms for matroid and knapsack means problems
• The subset assignment problem for data placement in caches

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

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