Matroid and Knapsack Center Problems
- 12 August 2015
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 75 (1) , 27-52
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Basic Research Program of China (2015CB358700, 2011CBA00300, 2011CBA00301)
- National Natural Science Foundation of China (61202009, 61033001, 61361136003)
- National Science Foundation (CCF-1317143)
- National Science Foundation (CCF-1217906)
This publication has 26 references indexed in Scilit:
- Constant Factor Approximation Algorithm for the Knapsack Median Problem2012
- Matroidal Degree-Bounded Minimum Spanning Trees2012
- Achieving anonymity via clusteringACM Transactions on Algorithms, 2010
- Asymmetric k -center is log * n -hard to approximateJournal of the ACM, 2005
- Parametric search and locating supply centers in trees2005
- Fault tolerant K-center problemsTheoretical Computer Science, 2000
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- 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