Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs

被引：0
|
作者：
Avivit Lazar
Arie Tamir
机构：
[1] Tel Aviv University,School of Mathematical Sciences
来源：
Algorithmica | 2013年 / 66卷
关键词：
Competitive location problems; Centroids; Paths; Trees; Polynomial algorithms;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We consider a common scenario in competitive location, where two competitors (providers) place their facilities (servers) on a network, and the users, which are modeled by the nodes of the network, can choose between the providers. We assume that each user has an inelastic demand, specified by a positive real weight. A user is fully served by a closest facility. The benefit (gain) of a competitor is his market share, i.e., the total weight (demand) of the users served at his facilities.
引用
收藏
页码：615 / 640
页数：25
相关论文
共 50 条
  • [41] Undiscretized dynamic programming: Faster algorithms for facility location and related problems on trees
    Shah, R
    Farach-Colton, M
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 108 - 115
  • [42] Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
    Binay Bhattacharya
    Qiaosheng Shi
    Arie Tamir
    Algorithmica, 2009, 55 : 601 - 618
  • [43] Optimal algorithms for the path/tree-shaped facility location problems in trees
    Bhattacharya, Binay
    Hu, Yuzhuang
    Shi, Qiaosheng
    Tamir, Arie
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 379 - +
  • [44] Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
    Bhattacharya, Binay
    Shi, Qiaosheng
    Tamir, Arie
    ALGORITHMICA, 2009, 55 (04) : 601 - 618
  • [45] Optimal algorithms for selective variants of the classical and inverse median location problems on trees
    Afrashteh, Esmaeil
    Alizadeh, Behrooz
    Baroughi, Fahimeh
    OPTIMIZATION METHODS & SOFTWARE, 2019, 34 (06): : 1213 - 1230
  • [46] SOLVING NP-HARD PROBLEMS ON GRAPHS THAT ARE ALMOST TREES AND AN APPLICATION TO FACILITY LOCATION-PROBLEMS
    GUREVICH, Y
    STOCKMEYER, L
    VISHKIN, U
    JOURNAL OF THE ACM, 1984, 31 (03) : 459 - 473
  • [47] Combinatorial Algorithms for Reverse Selective Undesirable Center Location Problems on Cycle Graphs
    Etemad R.
    Alizadeh B.
    Journal of the Operations Research Society of China, 2017, 5 (3) : 347 - 361
  • [48] Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties
    Li, Yu
    Du, Donglei
    Xiu, Naihua
    Xu, Dachuan
    ALGORITHMICA, 2015, 73 (02) : 460 - 482
  • [49] Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties
    Yu Li
    Donglei Du
    Naihua Xiu
    Dachuan Xu
    Algorithmica, 2015, 73 : 460 - 482
  • [50] Combinatorial Algorithms for Inverse Absolute and Vertex 1-Center Location Problems on Trees
    Alizadeh, Behrooz
    Burkard, Rainer E.
    NETWORKS, 2011, 58 (03) : 190 - 200
12345