New Approximation Results for Resource Replication Problems
- 10 March 2015
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 74 (3) , 969-991
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- The Matroid Median Problem2011
- Approximation algorithms for data placement on parallel disksACM Transactions on Algorithms, 2009
- Paths, Trees, and Flowers2009
- Scheduling with OutliersLecture Notes in Computer Science, 2009
- Approximation Algorithms for Data Placement ProblemsSIAM Journal on Computing, 2008
- The Capacitated K-Center ProblemSIAM Journal on Discrete Mathematics, 2000
- How to Allocate Network CentersJournal of Algorithms, 1993
- A unified approach to approximation algorithms for bottleneck problemsJournal of the ACM, 1986
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985
- Bottleneck extremaJournal of Combinatorial Theory, 1970