✦ 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
DOI: 10.2307/3689688

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extension of the Elzinga-Hearn Algorithm

Extension of the Elzinga-Hearn Algorithm to the Weighted Case

✍ Christakis Charalambous 📂 Article 📅 1982 🏛 INFORMS 🌐 English ⚖ 150 KB

The Parameterized Complexity of the Shar

The Parameterized Complexity of the Shared Center Problem

✍ Zhi-Zhong Chen, Wenji Ma, Lusheng Wang 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 762 KB

The Complexity Analysis of the Inverse C

The Complexity Analysis of the Inverse Center Location Problem

✍ M.C. Cai; X.G. Yang; J.Z. Zhang 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 69 KB

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

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 O(nlogn) randomizing algorithm for th

An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem

✍ Nimrod Megiddo; Eitan Zemel 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 710 KB