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 条
  • [1] The Online Connected Facility Location Problem
    San Felice, Mario Cesar
    Williamson, David P.
    Lee, Orlando
    [J]. LATIN 2014: THEORETICAL INFORMATICS, 2014, 8392 : 574 - 585
  • [2] A simple and deterministic competitive algorithm for online facility location
    Anagnostopoulos, A
    Bent, R
    Upfal, E
    Van Hentenryck, P
    [J]. INFORMATION AND COMPUTATION, 2004, 194 (02) : 175 - 202
  • [3] Randomized local search for the discrete competitive facility location problem
    A. A. Mel’nikov
    [J]. Automation and Remote Control, 2014, 75 : 700 - 714
  • [4] Randomized local search for the discrete competitive facility location problem
    Mel'nikov, A. A.
    [J]. AUTOMATION AND REMOTE CONTROL, 2014, 75 (04) : 700 - 714
  • [5] Sensitivity Analysis of a Genetic Algorithm for a Competitive Facility Location Problem
    Pangilinan, Jose Maria A.
    Janssens, Gerrit K.
    Caris, An
    [J]. INNOVATIONS AND ADVANCED TECHNIQUES IN SYSTEMS, COMPUTING SCIENCES AND SOFTWARE ENGINEERING, 2008, : 266 - +
  • [6] A cutting plane algorithm for the Capacitated Connected Facility Location Problem
    Gollowitzer, Stefan
    Gendron, Bernard
    Ljubic, Ivana
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2013, 55 (03) : 647 - 674
  • [7] A cutting plane algorithm for the Capacitated Connected Facility Location Problem
    Stefan Gollowitzer
    Bernard Gendron
    Ivana Ljubić
    [J]. Computational Optimization and Applications, 2013, 55 : 647 - 674
  • [8] Branch-and-bound algorithm for a competitive facility location problem
    Beresnev, Vladimir
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (08) : 2062 - 2070
  • [9] Cut Generation Algorithm for the Discrete Competitive Facility Location Problem
    Beresnev, V. L.
    Melnikov, A. A.
    [J]. DOKLADY MATHEMATICS, 2018, 97 (03) : 254 - 257
  • [10] An approximation algorithm for a competitive facility location problem with network effects
    Kung, Ling-Chieh
    Liao, Wei-Hung
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 267 (01) : 176 - 186
12345