Optimal data placement on networks with a constant number of clients
From MaRDI portal
Publication:2453166
DOI10.1016/J.TCS.2013.03.025zbMATH Open1359.68012OpenAlexW1654689658MaRDI QIDQ2453166FDOQ2453166
Authors: Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, V. Zissimopoulos 
Publication date: 6 June 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.03.025
Recommendations
- Approximation algorithms for data placement in arbitrary networks
- Placement algorithms for hierarchical cooperative caching
- Approximation Algorithms for Data Placement Problems
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Algorithms for non-uniform size data placement on parallel disks
Cites Work
- Title not available (Why is that?)
- Web caching using access statistics
- Approximation algorithms for data placement in arbitrary networks
- Approximation Algorithms for Data Placement Problems
- Title not available (Why is that?)
- Primal-dual algorithms for connected facility location problems
- Title not available (Why is that?)
- The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
- Title not available (Why is that?)
- Placement algorithms for hierarchical cooperative caching
- Database Programming Languages
Cited In (6)
- Algorithms for non-uniform size data placement on parallel disks
- Title not available (Why is that?)
- Placement of data replicas for optimal data availability in ring networks
- Approximation algorithms for data placement in arbitrary networks
- Cache me if you can: capacitated selfish replication games in networks
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Optimal data placement on networks with a constant number of clients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453166)
