If you need an accessible version of this item please contact JSTOR User Support

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

Zvi Drezner and Saharon Shelah
Mathematics of Operations Research
Vol. 12, No. 2 (May, 1987), pp. 255-261
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/3689688
Page Count: 7
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem
Preview not available

Abstract

We show that the complexity of the Elzinga-Hearn algorithm for the 1-center (single facility minimax) problem is $\Omega (n^{2})$. We also show that the algorithm reaches a solution within any given accuracy in O(n) time.

Page Thumbnails

  • Thumbnail: Page 
255
    255
  • Thumbnail: Page 
256
    256
  • Thumbnail: Page 
257
    257
  • Thumbnail: Page 
258
    258
  • Thumbnail: Page 
259
    259
  • Thumbnail: Page 
260
    260
  • Thumbnail: Page 
261
    261