A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem

被引:0
作者
Li, Shi [1 ]
机构
[1] Princeton Univ, Dept Comp Sci, Princeton, NJ 08540 USA
来源
AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT II | 2011年 / 6756卷
关键词
Approximation; Facility Location Problem; Theory;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present a 1.488 approximation algorithm for the metric uncapacitated facility location (UFL) problem. Previously the best algorithm was due to Byrka [1]. By linearly combining two algorithms A1(gamma f) for gamma f approximate to 1.6774 and the (1.11,1.78)-approximation algorithm A2 proposed by Jain, Mahdian and Saberi [8], Byrka gave a 1.5 approximation algorithm for the UFL problem. We show that gamma f is randomly selected from some distribution, the approximation ratio can be improved to 1.488. Our algorithm cuts the gap with the 1.463 approximability lower bound by almost 1/3.
引用
收藏
页码:77 / 88
页数:12
相关论文
共 12 条
  • [1] [Anonymous], ARXIV10073611
  • [2] Byrka J, 2007, LECT NOTES COMPUT SC, V4627, P29
  • [3] Charikar M., 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), P378, DOI 10.1109/SFFCS.1999.814609
  • [4] Improved approximation algorithms for the uncapacitated facility location problem
    Chudak, FA
    Shmoys, DB
    [J]. SIAM JOURNAL ON COMPUTING, 2003, 33 (01) : 1 - 25
  • [5] Guha Sudipto, 1998, P 9 ANN ACM SIAM S D, P649
  • [6] HEURISTICS FOR THE FIXED COST MEDIAN PROBLEM
    HOCHBAUM, DS
    [J]. MATHEMATICAL PROGRAMMING, 1982, 22 (02) : 148 - 162
  • [7] Greedy facility location algorithms analyzed using,dual fitting with factor-revealing LP
    Jain, K
    Mahdian, M
    Markakis, E
    Saberi, A
    Vazirani, VV
    [J]. JOURNAL OF THE ACM, 2003, 50 (06) : 795 - 824
  • [8] Jain K., 2002, STOC, P731, DOI [10.1145/509907.510012, DOI 10.1016/J.0RL.2006.03.0]
  • [9] LIN JH, 1992, INFORM PROCESS LETT, V44, P245, DOI [10.1016/0020-0190(92)90208-D, 10.1109/ICASSP.1992.226074]
  • [10] MADHUKAR R.KORUPOLU., 1998, SODA 98, P1