An Improved Approximation Algorithm for Knapsack Median Using Sparsification
暂无分享,去创建一个
Aravind Srinivasan | Jaroslaw Byrka | Joachim Spoerhase | Thomas Pensyl | Bartosz Rybicki | Khoa Trinh
[1] Chaitanya Swamy. Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications , 2014, APPROX-RANDOM.
[2] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[3] Sudipto Guha,et al. A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.
[4] Shi Li,et al. Approximating k-median via pseudo-approximation , 2012, STOC '13.
[5] Shi Li,et al. A Dependent LP-Rounding Approach for the k-Median Problem , 2012, ICALP.
[6] Amit Kumar,et al. Constant factor approximation algorithm for the knapsack median problem , 2012, SODA.
[7] Evangelos Markakis,et al. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.
[8] Amit Kumar,et al. The matroid median problem , 2011, SODA '11.
[9] Aravind Srinivasan,et al. An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization , 2014, SODA.
[10] Vijay V. Vazirani,et al. Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.
[11] David P. Williamson,et al. The Design of Approximation Algorithms , 2011 .