Local Search Algorithms for the Red-Blue Median Problem

[1]  Amit Kumar,et al.  The matroid median problem , 2011, SODA '11.

[2]  Adam Meyerson,et al.  Minimizing Average Shortest Path Distances via Shortcut Edge Addition , 2009, APPROX-RANDOM.

[3]  Mohammad Taghi Hajiaghayi,et al.  Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location , 2009, TALG.

[4]  Anupam Gupta,et al.  Simpler Analyses of Local Search Algorithms for Facility Location , 2008, ArXiv.

[5]  Vahab S. Mirrokni,et al.  Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[6]  Satish Rao,et al.  A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem , 2007, SIAM J. Comput..

[7]  Mohammad Taghi Hajiaghayi,et al.  The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema , 2006, SODA '06.

[8]  Vahab S. Mirrokni,et al.  Tight approximation algorithms for maximum general assignment problems , 2006, SODA '06.

[9]  Nikhil R. Devanur,et al.  Price of Anarchy, Locality Gap, and a Network Service Provider Game , 2005, WINE.

[10]  Sudipto Guha,et al.  Improved Combinatorial Algorithms for Facility Location Problems , 2005, SIAM J. Comput..

[11]  Jiawei Zhang,et al.  A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract) , 2004, IPCO.

[12]  Kamesh Munagala,et al.  Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..

[13]  David B. Shmoys,et al.  Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties , 2003, ESA.

[14]  Mohammad Mahdian,et al.  Universal Facility Location , 2003, ESA.

[15]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[16]  Sudipto Guha,et al.  A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.

[17]  Amin Saberi,et al.  A new greedy approach for facility location problems , 2002, STOC '02.

[18]  Éva Tardos,et al.  Facility location with nonuniform hard capacities , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[19]  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.

[20]  Samir Khuller,et al.  Algorithms for facility location problems with outliers , 2001, SODA '01.

[21]  Rajmohan Rajaraman,et al.  Analysis of a local search heuristic for facility location problems , 2000, SODA '98.

[22]  David P. Williamson,et al.  Improved approximation algorithms for capacitated facility location problems , 1999, IPCO.

[23]  Satish Rao,et al.  Approximation schemes for Euclidean k-medians and related problems , 1998, STOC '98.

[24]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[25]  Zvi Galil,et al.  Proceedings of the 30th IEEE symposium on Foundations of computer science , 1994, FOCS 1994.

[26]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[27]  Jeffrey Scott Vitter,et al.  Approximation Algorithms for Geometric Median Problems , 1992, Inf. Process. Lett..

[28]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[29]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[30]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[31]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[32]  Konrad Reif,et al.  private communication , 1969 .