Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
暂无分享,去创建一个
[1] Chaitanya Swamy,et al. Local-Search based Approximation Algorithms for Mobile Facility Location Problems , 2013, SODA.
[2] Inge Li Gørtz,et al. Locating depots for capacitated vehicle routing , 2011, APPROX-RANDOM.
[3] Chaitanya Swamy,et al. Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems , 2010, IPCO.
[4] Chaitanya Swamy,et al. Approximation Algorithms for Data Placement Problems , 2008, SIAM J. Comput..
[5] Fabián A. Chudak,et al. Improved Approximation Algorithms for the Uncapacitated Facility Location Problem , 2003, SIAM J. Comput..
[6] Éva Tardos,et al. Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.
[7] William J. Cook,et al. Combinatorial optimization , 1997 .
[8] Amit Kumar,et al. The matroid median problem , 2011, SODA '11.
[9] Mohammad R. Salavatipour,et al. Minimizing Movement in Mobile Facility Location Problems , 2008, FOCS.
[10] Shi Li,et al. A Dependent LP-Rounding Approach for the k-Median Problem , 2012, ICALP.
[11] Rajmohan Rajaraman,et al. Approximation algorithms for data placement in arbitrary networks , 2001, SODA '01.
[12] Sudipto Guha,et al. A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.
[13] Chaitanya Swamy,et al. Fault-tolerant facility location , 2003, SODA '03.
[14] Amit Kumar,et al. Constant factor approximation algorithm for the knapsack median problem , 2012, SODA.