Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP-Reference-Cited by-同舟云学术

Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Published:2003-11 Issue:6 Volume:50 Page:795-824
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Jain Kamal¹,Mahdian Mohammad²,Markakis Evangelos³,Saberi Amin³,Vazirani Vijay V.³

Affiliation:

1. Microsoft Research, Redmond, Washington

2. Laboratory for Computer Science, MIT, Cambridge, Massachusetts

3. Georgia Institute of Technology, Atlanta, Georgia

Abstract

In this article, we will formalize the method of dual fitting and the idea of factor-revealing LP. This combination is used to design and analyze two greedy algorithms for the metric uncapacitated facility location problem. Their approximation factors are 1.861 and 1.61, with running times of O ( m log m ) and O ( n 3 ), respectively, where n is the total number of vertices and m is the number of edges in the underlying complete bipartite graph between cities and facilities. The algorithms are used to improve recent results for several variants of the problem.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/950620.950621

Reference42 articles.

1. Local search heuristic for k-median and facility location problems

2. Beasley J. E. 2002. Operations research library. http://mscmga.ms.ic.ac.uk/info.html.]] Beasley J. E. 2002. Operations research library. http://mscmga.ms.ic.ac.uk/info.html.]]

3. High-density model for server allocation and placement

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

1. LP-Rounding Based Algorithm for Capacitated Uniform Facility Location Problem with Soft Penalties;Tsinghua Science and Technology;2025-02

2. Improved lower bound for differentially private facility location;Information Processing Letters;2025-01

3. Approximation and Heuristic Algorithms for the Priority Facility Location Problem with Outliers;Tsinghua Science and Technology;2024-12

4. Distributed Data Placement and Content Delivery in Web Caches with Non-Metric Access Costs;Proceedings of the ACM Web Conference 2024;2024-05-13

5. Approximation algorithms for the fault-tolerant facility location problem with submodular penalties;Journal of Combinatorial Optimization;2024-02-26