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 条

[1] A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network
Binay Bhattacharya
Tsunehiko Kameda
Zhao Song
Algorithmica, 2014, 70 : 2 - 21
[2] A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network
Bhattacharya, Binay
Kameda, Tsunehiko
Song, Zhao
ALGORITHMICA, 2014, 70 (01) : 2 - 21
[3] The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
Tran Hoai Ngoc Nhan
Kien Trung Nguyen
Huong Nguyen-Thu
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2023, 40 (03)
[4] Minmax-regret robust 1-median location on a tree
Chen, BT
Lin, CS
NETWORKS, 1998, 31 (02) : 93 - 103
[5] Improved algorithms for the minmax regret 1-median problem
Yu, Hung-I
Lin, Tzu-Chin
Wang, Biing-Feng
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 52 - 62
[6] Improved Algorithms for the Minmax-Regret 1-Center and 1-Median Problems
Yu, Hung-I.
Lin, Tzu-Chin
Wang, Biing-Feng
ACM TRANSACTIONS ON ALGORITHMS, 2008, 4 (03)
[7] Inverse 1-Median Problem on Block Graphs with Variable Vertex Weights
Kien Trung Nguyen
Journal of Optimization Theory and Applications, 2016, 168 : 944 - 957
[8] Inverse 1-Median Problem on Block Graphs with Variable Vertex Weights
Kien Trung Nguyen
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2016, 168 (03) : 944 - 957
[9] An improved algorithm for the minmax regret median problem on a tree
Averbakh, I
Berman, O
NETWORKS, 2003, 41 (02) : 97 - 103
[10] Combinatorial algorithms for the minmax robust median subtree problem on tree networks with interval vertex weights
Nguyen, Kien Trung
Nguyen-Thu, Huong
Le, Huy Minh
Hiep, Tran Thanh
ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2025, 18 (02)

← 1 2 3 4 5 →