๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem

โœ Scribed by Zvi Drezner and Saharon Shelah


Book ID
126600091
Publisher
INFORMS
Year
1987
Tongue
English
Weight
275 KB
Volume
12
Category
Article
ISSN
0364-765X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Improved algorithms for the minmax-regre
โœ 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