Affiliation:
1. College of Computing, Georgia Institute of Technology, Atlanta, GA
Abstract
We present approximation algorithms for the metric uncapacitated facility location problem and the metric
k
-median problem achieving guarantees of 3 and 6 respectively. The distinguishing feature of our algorithms is their low running time:
O(m
log
m
) and
O(m
log
m(L
+ log (
n
))) respectively, where
n
and
m
are the total number of vertices and edges in the underlying complete bipartite graph on cities and facilities. The main algorithmic ideas are a new extension of the primal-dual schema and the use of Lagrangian relaxation to derive approximation algorithms.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
482 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献