Combinatorial approximation algorithms for the robust facility location problem with penalties

被引:0
|
作者
Fengmin Wang
Dachuan Xu
Chenchen Wu
机构
[1] Beijing University of Technology,Department of Information and Operations Research
[2] Tianjin University of Technology,College of Science
来源
关键词
Facility location problem; Approximation algorithm ; Primal–dual; Greedy augmentation;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we consider the robust facility location problem with penalties, aiming to serve only a specified fraction of the clients. We formulate this problem as an integer linear program to identify which clients must be served. Based on the corresponding LP relaxation and dual program, we propose a primal–dual (combinatorial) 3-approximation algorithm. Combining the greedy augmentation procedure, we further improve the above approximation ratio to 2.
引用
收藏
页码:483 / 496
页数:13
相关论文
共 50 条
  • [21] An improved approximation algorithm for uncapacitated facility location problem with penalties
    Xu, G
    Xu, JH
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 644 - 653
  • [22] Improved approximation algorithms for the robust fault-tolerant facility location problem
    Li, Yu
    Xu, Dachuan
    Du, Donglei
    Xiu, Naihua
    [J]. INFORMATION PROCESSING LETTERS, 2012, 112 (10) : 361 - 364
  • [23] Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties
    Li, Yu
    Du, Donglei
    Xiu, Naihua
    Xu, Dachuan
    [J]. ALGORITHMICA, 2015, 73 (02) : 460 - 482
  • [24] Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties
    Yu Li
    Donglei Du
    Naihua Xiu
    Dachuan Xu
    [J]. Algorithmica, 2015, 73 : 460 - 482
  • [25] Approximation algorithms for the robust facility leasing problem
    Lu Han
    Dachuan Xu
    Min Li
    Dongmei Zhang
    [J]. Optimization Letters, 2018, 12 : 625 - 637
  • [26] Approximation algorithms for the robust facility leasing problem
    Han, Lu
    Xu, Dachuan
    Li, Min
    Zhang, Dongmei
    [J]. OPTIMIZATION LETTERS, 2018, 12 (03) : 625 - 637
  • [27] Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties
    Xiaofei Liu
    Weidong Li
    [J]. Journal of Combinatorial Optimization, 2022, 44 : 1964 - 1976
  • [28] Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties
    Liu, Xiaofei
    Li, Weidong
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (03) : 1964 - 1976
  • [29] Improved approximation algorithm for universal facility location problem with linear penalties
    Xu, Yicheng
    Xu, Dachuan
    Du, Donglei
    Wu, Chenchen
    [J]. THEORETICAL COMPUTER SCIENCE, 2019, 774 (143-151) : 143 - 151
  • [30] Approximation Algorithms for a Facility Location Problem with Service Capacities
    Massberg, Jens
    Vygen, Jens
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2008, 4 (04)