Sub-logarithmic distributed algorithms for metric facility location-Reference-Cited by-同舟云学术

Sub-logarithmic distributed algorithms for metric facility location

Published:2015-04-01 Issue:5 Volume:28 Page:351-374
ISSN:0178-2770
Container-title:Distributed Computing
language:en
Short-container-title:Distrib. Comput.

Author:

Hegeman James W.,Pemmaraju Sriram V.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00446-015-0243-x.pdf

Reference33 articles.

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

2. Berns, A., Hegeman, J., Pemmaraju, S.V.: Super-fast distributed algorithms for metric facility location. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 7392, pp. 428–439. Springer, Berlin Heidelberg (2012)

3. Berns, A., Hegeman, J., Pemmaraju, S.V.: Super-fast distributed algorithms for metric facility location. CoRR (2013). arXiv:1308.2473

4. Bădoiu, M., Czumaj, A., Indyk, P., Sohler, C.: Facility location in sublinear time. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 3580, pp. 866–877. Springer, Berlin Heidelberg (2005)

5. Cornuejols, G., Nemhouser, G., Wolsey, L.: Discrete Location Theory. Wiley, New York (1990)

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

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

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