THE SLAB DIVIDING APPROACH TO SOLVE THE EUCLIDEAN P-CENTER PROBLEM

Full metadata record

DC Field	Value	Language
dc.contributor.author	HWANG, RZ	en_US
dc.contributor.author	LEE, RCT	en_US
dc.contributor.author	CHANG, RC	en_US
dc.date.accessioned	2014-12-08T15:04:40Z	-
dc.date.available	2014-12-08T15:04:40Z	-
dc.date.issued	1993-01-01	en_US
dc.identifier.issn	0178-4617	en_US
dc.identifier.uri	http://dx.doi.org/10.1007/BF01185335	en_US
dc.identifier.uri	http://hdl.handle.net/11536/3153	-
dc.description.abstract	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))).	en_US
dc.language.iso	en_US	en_US
dc.subject	COMPUTATIONAL GEOMETRY	en_US
dc.subject	NP-COMPLETENESS	en_US
dc.title	THE SLAB DIVIDING APPROACH TO SOLVE THE EUCLIDEAN P-CENTER PROBLEM	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1007/BF01185335	en_US
dc.identifier.journal	ALGORITHMICA	en_US
dc.citation.volume	9	en_US
dc.citation.issue	1	en_US
dc.citation.spage	1	en_US
dc.citation.epage	22	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1993KH91400001	-
dc.citation.woscount	26	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.