標題: THE SLAB DIVIDING APPROACH TO SOLVE THE EUCLIDEAN P-CENTER PROBLEM
作者: HWANG, RZ
LEE, RCT
CHANG, RC
資訊工程學系
Department of Computer Science
關鍵字: COMPUTATIONAL GEOMETRY;NP-COMPLETENESS
公開日期: 1-一月-1993
摘要: Given n demand points on the plane, the Euclidean P-Center problem is to find P supply points, such that the longest distance between each demand point and its closest supply point is minimized. The time complexity of the most efficient algorithm, up to now, is 0(n2P-1 . log n). In this paper, we present an algorithm with time complexity 0(n0(square-root P))).
URI: http://dx.doi.org/10.1007/BF01185335
http://hdl.handle.net/11536/3153
ISSN: 0178-4617
DOI: 10.1007/BF01185335
期刊: ALGORITHMICA
Volume: 9
Issue: 1
起始頁: 1
結束頁: 22
顯示於類別:期刊論文


文件中的檔案:

  1. A1993KH91400001.pdf