Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties-Reference-Cited by-同舟云学术

Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties

Published:2003 Issue: Volume: Page:31-42
ISSN:0302-9743
Container-title:Algorithms - ESA 2003
language:
Short-container-title:

Author:

Archer Aaron,Rajagopalan Ranjithkumar,Shmoys David B.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-39658-1_6

Reference24 articles.

1. Ageev, A., Sviridenko, M.: An approximation algorithm for the uncapacitated facility location problem (manuscript) (1997)

2. Arora, S., Bollobas, B., Lovász, L.: Proving integrality gaps without knowing the linear program. In: 43rd FOCS, pp. 313–322 (2002)

3. Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristic for k-median and facility location problems. In: 33rd STOC, pp. 21–29 (2001)

4. Balinski, M.: On finding integer solutions to linear programs. In: Proc. IBM Scientific Computing Symp. on Combinatorial Problems, pp. 225–248 (1966)

5. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: 30th STOC, pp. 161–168 (1998)

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

1. Universal Algorithms for Clustering Problems;ACM Transactions on Algorithms;2023-03-09

2. LP-based approximation for uniform capacitated facility location problem;Discrete Optimization;2022-08

3. Near-optimal clustering in the k-machine model;Theoretical Computer Science;2022-01

4. Near-Optimal Clustering in the k-machine model;Proceedings of the 19th International Conference on Distributed Computing and Networking;2018-01-04

5. Standortprobleme;Kombinatorische Optimierung;2018