Author:
Ghodselahi Abdolhamid,Kuhn Fabian
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Ahmadian, S., Friggstad, Z., Swamy, C.: Local-search based approximation algorithms for mobile facility location problems. In: Proceedings of the 24th Symposium on Discrete Algorithms (SODA), pp. 1607–1621 (2013)
2. Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 121–164 (2012)
3. Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. J. Comput. 33(3), 544–562 (2004)
4. Bansal, N., Buchbinder, N., Madry, A., Naor, J.S.: A polylogarithmic-competitive algorithm for the k-server problem. In: Proceedings of the 52nd Symposium on Foundations of Computer Science (FOCS), pp. 267–276 (2011)
5. Byrka, J., Aardal, K.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. J. Comput. 39(6), 2212–2231 (2010)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Toward Online Mobile Facility Location on General Metrics;Theory of Computing Systems;2023-10-06
2. Online facility location with mobile facilities;Theoretical Computer Science;2022-03
3. Online Facility Location with Mobile Facilities;Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures;2018-07-11