Local Search Algorithms for the Red-Blue Median Problem-Reference-Cited by-同舟云学术

Local Search Algorithms for the Red-Blue Median Problem

Published:2011-07-12 Issue:4 Volume:63 Page:795-814
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Hajiaghayi M.,Khandekar R.,Kortsarz G.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-011-9547-9.pdf

Reference31 articles.

1. Lecture Notes in Comput. Sci.;A. Archer,2003

2. Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-medians and related problems. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 106–113 (1998)

3. Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33(3), 544–562 (2004)

4. Balas, E.: The prize collecting traveling salesman problem. Networks 19(6), 621–636 (1989)

5. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 161–168 (1998)

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques;Lecture Notes in Computer Science;2024

2. Scalable and space-efficient Robust Matroid Center algorithms;Journal of Big Data;2023-04-17

3. Improved Approximation Algorithms for Matroid and Knapsack Means Problems;International Journal of Foundations of Computer Science;2023-02-03

4. Improved approximation algorithms for solving the squared metric k-facility location problem;Theoretical Computer Science;2023-01

5. Clustering with Fair-Center Representation;Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2022-08-14