Approximation algorithms for data placement in arbitrary networks
From MaRDI portal
Recommendations
- Approximation Algorithms for Data Placement Problems
- Approximation algorithms for data management in networks
- Optimal data placement on networks with a constant number of clients
- scientific article; zbMATH DE number 1445307
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Cited in
(20)- Joint object placement and node dimensioning for internet content distribution
- Distributed backup placement in networks
- Facility location with red-blue demands
- Multi-objective evolutionary algorithms for a reliability location problem
- Improved approximation algorithms for data migration
- Optimal data placement on networks with a constant number of clients
- New approximation results for resource replication problems
- Bandwidth constrained placement in a WAN
- Approximation algorithms for data placement on parallel disks
- Replica placement on directed acyclic graphs
- Approximation Algorithms for Data Placement Problems
- Comparison and analysis of ten static heuristics-based Internet data replication techniques
- scientific article; zbMATH DE number 1955844 (Why is no real title available?)
- scientific article; zbMATH DE number 2114004 (Why is no real title available?)
- 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 optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
- Online social network data placement over clouds
- A polynomial-time approximation scheme for fault-tolerant distributed storage
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
This page was built for publication: Approximation algorithms for data placement in arbitrary networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768361)
