𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved algorithms for the minmax-regret 1-center and 1-median problems

✍ Scribed by Yu, Hung-I.; Lin, Tzu-Chin; Wang, Biing-Feng

Book ID
125524856
Publisher
Association for Computing Machinery
Year
2008
Tongue
English
Weight
258 KB
Volume
4
Category
Article
ISSN
1549-6325

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Improved algorithms for the minmax-regre
Improved algorithms for the minmax-regret 1-center and 1-median problems
✍ Yu, Hung-I.; Lin, Tzu-Chin; Wang, Biing-Feng πŸ“‚ Article πŸ“… 2008 πŸ› Association for Computing Machinery 🌐 English βš– 258 KB

In this article, efficient algorithms are presented for the minmax-regret 1-center and 1-median problems on a general graph and a tree with uncertain vertex weights. For the minmax-regret 1-center problem on a general graph, we improve the previous upper bound from __O__ ( __mn__ ^2^ log __n__ ) to

An improved algorithm for the minmax reg
An improved algorithm for the minmax regret median problem on a tree
✍ Igor Averbakh; Oded Berman πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a β€œminmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because