Optimal data placement on networks with a constant number of clients
Authors:
- Eric AngelEAEric Angel
- Evripidis BampisEBEvripidis Bampis
- Gerasimos G. PollatosGPGerasimos G. Pollatos
- Vassilis ZissimopoulosVZVassilis Zissimopoulos
- 1 June 2014
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 540-541, 82-88
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Fault-tolerant facility locationACM Transactions on Algorithms, 2008
- On the Social Cost of Distributed Selfish Content Replication2008
- Approximation Algorithms for Data Placement ProblemsSIAM Journal on Computing, 2008
- Distributed Selfish ReplicationIEEE Transactions on Parallel and Distributed Systems, 2006
- The Directed Steiner Network Problem is Tractable for a Constant Number of TerminalsSIAM Journal on Computing, 2006
- Primal–Dual Algorithms for Connected Facility Location ProblemsAlgorithmica, 2004
- The Directed Steiner Network problem is tractable for a constant number of terminals2003
- Placement Algorithms for Hierarchical Cooperative CachingJournal of Algorithms, 2001
- Replication algorithms in a remote caching architectureIEEE Transactions on Parallel and Distributed Systems, 1993