Super-Fast Distributed Algorithms for Metric Facility Location-Reference-Cited by-同舟云学术

Super-Fast Distributed Algorithms for Metric Facility Location

Published:2012 Issue: Volume: Page:428-439
ISSN:0302-9743
Container-title:Automata, Languages, and Programming
language:
Short-container-title:

Author:

Berns Andrew,Hegeman James,Pemmaraju Sriram V.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-31585-5_39.pdf

Reference21 articles.

1. Balinski, M.: On finding integer solutions to linear programs. In: Proceedings of IBM Scientific Computing Symposium on Combinatorial Problems, pp. 225–248 (1966)

2. Lecture Notes in Computer Science;M. Bădoiu,2005

3. Cornuejols, G., Nemhouser, G., Wolsey, L.: Discrete Location Theory. Wiley (1990)

4. Eede, M.V., Hansen, P., Kaufman, L.: A plant and warehouse location problem. Operational Research Quarterly 28(3), 547–554 (1977)

5. Lecture Notes in Computer Science;C. Frank,2007

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

1. O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique;2024 20th International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT);2024-04-29

3. k-Center Clustering in Distributed Models;Lecture Notes in Computer Science;2024

4. An incremental facility location clustering with a new hybrid constrained pseudometric;Pattern Recognition;2023-09

5. Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE;International Journal of Foundations of Computer Science;2020-11