𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The 1-median and 1-highway problem

✍ Scribed by Díaz-Báñez, J.M.; Korman, M.; Pérez-Lantero, P.; Ventura, I.

Book ID
119234586
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
293 KB
Volume
225
Category
Article
ISSN
0377-2217

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