Obtaining online approximation algorithms for facility dispersion from offline algorithms

被引:2
|
作者
Rosenkrantz, Daniel J.
Tayi, Giri K.
Ravi, S. S.
机构
[1] SUNY Albany, Dept Comp Sci, Albany, NY 12222 USA
[2] SUNY Albany, Sch Business, Dept Management Sci & Informat Syst, Albany, NY 12222 USA
关键词
facility dispersion; offline algorithm; online algorithm; approximation ratio; competitive ratio;
D O I
10.1002/net.20109
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Facility dispersion problems arise in the context of placing obnoxious facilities and retail outlets. In the off line version of such a problem, the input consists of a complete graph on n nodes, a nonnegative weight (distance) for each edge, and the number k <= n of facilities to be placed. The goal is to choose a facility placement consisting of k nodes so as to maximize a given measure of the distances among the facilities. Here, we consider an online version of the problem where the value of k is not known apriori; instead, requests for facilities arrive one at a time. It is also required that previously placed facilities cannot be moved or eliminated. Our main result is that for any objective that satisfies two properties, namely monotonicity and graceful degradation, any off line approximation algorithm with a performance guarantee p can be used to develop an algorithm with competitive ratio c rho for the online version, where c is a constant independent of the problem instance. Objectives for which our result applies include the average edge weight and average weight of a star subgraph. The result holds even when the edge weights do not satisfy the triangle inequality. We also identify dispersion objectives for which the offline and online versions have different behaviors when only one of the above two properties Is satisfied. (C) 2006 Wiley Periodicals, Inc.
引用
收藏
页码:206 / 217
页数:12
相关论文
共 50 条
  • [41] Approximation algorithms for the priority facility location problem with penalties
    Fengmin Wang
    Dachuan Xu
    Chenchen Wu
    Journal of Systems Science and Complexity, 2015, 28 : 1102 - 1114
  • [42] Improved approximation algorithms for capacitated facility location problems
    Fabián A. Chudak
    David P. Williamson
    Mathematical Programming, 2005, 102 : 207 - 222
  • [43] Improved approximation algorithms for multilevel facility location problems
    Ageev, A
    APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2002, 2462 : 5 - 13
  • [44] Improved approximation algorithms for capacitated facility location problems
    Chudak, FA
    Williamson, DP
    MATHEMATICAL PROGRAMMING, 2005, 102 (02) : 207 - 222
  • [45] Efficient Online Linear Optimization with Approximation Algorithms
    Garber, Dan
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017), 2017, 30
  • [46] Improved approximation algorithms for capacitated facility location problems
    Chudak, FA
    Williamson, DP
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1999, 1610 : 99 - 113
  • [47] Improved approximation algorithms for the uncapacitated facility location problem
    Chudak, FA
    Shmoys, DB
    SIAM JOURNAL ON COMPUTING, 2003, 33 (01) : 1 - 25
  • [48] Efficient Online Linear Optimization with Approximation Algorithms
    Garber, Dan
    MATHEMATICS OF OPERATIONS RESEARCH, 2021, 46 (01) : 204 - 220
  • [49] Offline and online algorithms for single-minded selling problem
    Zhang, Yong
    Chin, Francis Y. L.
    Poon, Sheung-Hung
    Ting, Hing-Fung
    Xu, Dachuan
    Yu, Dongxiao
    THEORETICAL COMPUTER SCIENCE, 2020, 821 (821) : 15 - 22
  • [50] Online and offline algorithms for the sorting buffers problem on the line metric
    Khandekar, Rohit
    Pandit, Vinayaka
    JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (01) : 24 - 35