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 条
  • [1] Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs
    Lazar, Avivit
    Tamir, Arie
    ALGORITHMICA, 2013, 66 (03) : 615 - 640
  • [2] Improved algorithms for replacement paths problems in restricted graphs
    Bhosle, AM
    OPERATIONS RESEARCH LETTERS, 2005, 33 (05) : 459 - 466
  • [3] (r, p)-centroid problems on paths and trees
    Spoerhase, J.
    Wirth, H-C.
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5128 - 5137
  • [4] Parameterized Approximation Algorithms for Some Location Problems in Graphs
    Leitert, Arne
    Dragan, Feodor F.
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2017, PT II, 2017, 10628 : 348 - 361
  • [5] Parameterized approximation algorithms for some location problems in graphs
    Leitert, Arne
    Dragan, Feodor F.
    THEORETICAL COMPUTER SCIENCE, 2019, 755 : 48 - 64
  • [6] An improved g-centroid location algorithm for ptolemaic graphs
    Department of Computer Science and Computer Engineering La Trobe University, 3086, VIC, Australia
    Int. J. Multimedia Ubiquitous Eng., 2009, 2 (91-98):
  • [7] Parallel algorithms for continuous competitive location problems
    Redondo, Juana L.
    Fernandez, Jose
    Garcia, Inmaculada
    Ortigosa, Pilar M.
    OPTIMIZATION METHODS & SOFTWARE, 2008, 23 (05): : 779 - 791
  • [8] Parallel algorithms for continuous multifacility competitive location problems
    J. L. Redondo
    J. Fernández
    I. García
    P. M. Ortigosa
    Journal of Global Optimization, 2011, 50 : 557 - 573
  • [9] Parallel algorithms for continuous multifacility competitive location problems
    Redondo, J. L.
    Fernandez, J.
    Garcia, I.
    Ortigosa, P. M.
    JOURNAL OF GLOBAL OPTIMIZATION, 2011, 50 (04) : 557 - 573
  • [10] Improved algorithms for the k simple shortest paths and the replacement paths problems
    Gotthilf, Zvi
    Lewenstein, Moshe
    INFORMATION PROCESSING LETTERS, 2009, 109 (07) : 352 - 355
12345