A Randomized -Competitive Algorithm for the Online Connected Facility Location Problem

被引：0
|
作者：
San Felice, Mario Cesar [1 ]
Williamson, David P. [2 ]
Lee, Orlando [1 ]
机构：
[1] Univ Estadual Campinas, Inst Comp, BR-13083852 Campinas, SP, Brazil
[2] Cornell Univ, Sch Operat Res & Informat Engn, Ithaca, NY 14853 USA
来源：
ALGORITHMICA | 2016年 / 76卷 / 04期
基金：
巴西圣保罗研究基金会; 美国国家科学基金会;
关键词：
Online algorithms; Competitive analysis; Connected facility location; Steiner tree; Approximation algorithms; Randomized algorithms; APPROXIMATION ALGORITHMS;
D O I：
10.1007/s00453-016-0115-1
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The Connected Facility Location (CFL) is a network design problem that arises from a combination of the Uncapacitated Facility Location (FL) and the Steiner Tree (ST) problems. The Online Connected Facility Location problem (OCFL) is an online version of the CFL. San Felice et al. (2014) presented a randomized algorithm for the OCFL and proved that it is -competitive, where n is the number of clients. That algorithm combines the sample-and-augment framework of Gupta, Kumar, Pal, and Roughgarden with previous algorithms for the Online Facility Location (OFL) and the Online Steiner Tree (OST) problems. In this paper we use a more precise analysis to show that the same algorithm is -competitive. Since there is a lower bound of for this problem, our result achieves the best possible competitive ratio, asymptotically.
引用
收藏
页码：1139 / 1157
页数：19
相关论文
共 50 条
  • [21] Approximate algorithms for the competitive facility location problem
    Beresnev V.L.
    Mel'nikov A.A.
    [J]. Journal of Applied and Industrial Mathematics, 2011, 5 (2) : 180 - 190
  • [22] Competitive Facility Location Problem with Exotic Products
    Xue, Zhaojie
    Gao, Ying
    Yin, Jingjing
    [J]. 2017 4TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND APPLICATIONS (ICIEA), 2017, : 173 - 177
  • [23] A PTAS for the Geometric Connected Facility Location Problem
    Miyazawa, Flavio K.
    Pedrosa, Lehilton L. C.
    Schouery, Rafael C. S.
    de Souza, Renata G. D.
    [J]. THEORY OF COMPUTING SYSTEMS, 2017, 61 (03) : 871 - 892
  • [24] A PTAS for the Geometric Connected Facility Location Problem
    Flávio K. Miyazawa
    Lehilton L. C. Pedrosa
    Rafael C. S. Schouery
    Renata G. D. de Souza
    [J]. Theory of Computing Systems, 2017, 61 : 871 - 892
  • [25] Parallel Optimization Algorithm for Competitive Facility Location
    Lancinskas, Algirdas
    Martinez Ortigosa, Pilar
    Zilinskas, Julius
    [J]. MATHEMATICAL MODELLING AND ANALYSIS, 2015, 20 (05) : 619 - 640
  • [26] A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
    Hyunwoo Jung
    Mohammad Khairul Hasan
    Kyung-Yong Chwa
    [J]. Journal of Combinatorial Optimization, 2009, 18 : 258 - 271
  • [27] A modified genetic algorithm for the capacitated competitive facility location problem with the partial demand satisfaction
    Nasiri, Mohammad Mahdi
    Mahmoodian, Vahid
    Rahbari, Ali
    Farahmand, Shabnam
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 124 : 435 - 448
  • [28] The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
    Beresnev V.L.
    Mel'nikov A.A.
    [J]. Journal of Applied and Industrial Mathematics, 2014, 8 (2) : 177 - 189
  • [29] A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
    Jung, Hyunwoo
    Hasan, Mohammad Khairul
    Chwa, Kyung-Yong
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2009, 18 (03) : 258 - 271
  • [30] Approximate robust optimization for the Connected Facility Location problem
    Bardossy, M. Gisela
    Raghavan, S.
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 210 : 246 - 260
12345