Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights

被引：0

作者：

Bhattacharya, Binay ^{[1
]}

Kameda, Tsunehiko ^{[1
]}

Song, Zhao ^{[1
]}

机构：

[1] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada

来源：

ALGORITHMS AND COMPUTATION, ISAAC 2012 | 2012年 / 7676卷

关键词：

LOCATION; ALGORITHM;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In a facility location problem, if the vertex weights are uncertain one may look for a "robust" solution that minimizes "regret." The most efficient previously known algorithm for finding the minmax regret 1-median on trees with positive and negative vertex weights takes O(n(2)) time. In this paper, we improve it to O(n log(2) n).

引用

页码：588 / 597

页数：10

共 50 条

[31] The Inverse 1-Median Problem on Tree Networks with Variable Real Edge Lengths
Wu, Longshu
Lee, Joonwhoan
Zhang, Jianhua
Wang, Qin
MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
[32] On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
Kien Trung Nguyen
Huong Nguyen-Thu
Nguyen Thanh Hung
Mathematical Methods of Operations Research, 2018, 88 : 147 - 159
[33] Two Paths Location of a Tree with Positive or Negative Weights
Zhou, Jianjie
Kang, Liying
Shan, Erfang
COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014), 2014, 8881 : 329 - 342
[34] Two paths location of a Tree with positive or negative weights
Zhou, Jianjie
Kang, Liying
Shan, Erfang
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8881 : 329 - 342
[35] Two paths location of a tree with positive or negative weights
Zhou, Jianjie
Kang, Liying
Shan, Erfang
THEORETICAL COMPUTER SCIENCE, 2015, 607 : 296 - 305
[36] On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
Kien Trung Nguyen
Huong Nguyen-Thu
Nguyen Thanh Hung
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2018, 88 (02) : 147 - 159
[37] Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
Bhattacharya, Binay
Kameda, Tsunehiko
Song, Zhao
DISCRETE APPLIED MATHEMATICS, 2015, 195 : 18 - 30
[38] Solving the 1-median problem on a network with continuous demand and demand surplus
Blanquero, Rafael
Carrizosa, Emilio
Toth, Boglarka G.
Kovacs, Kristof
COMPUTERS & OPERATIONS RESEARCH, 2023, 160
[39] Median line location problem with positive and negative weights and Euclidean norm
Golpayegani, Mehdi
Fathali, Jafar
Khosravian, Eiman
NEURAL COMPUTING & APPLICATIONS, 2014, 24 (3-4): : 613 - 619
[40] Median line location problem with positive and negative weights and Euclidean norm
Mehdi Golpayegani
Jafar Fathali
Eiman Khosravian
Neural Computing and Applications, 2014, 24 : 613 - 619

← 1 2 3 4 5 →