Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/655
| Title: | An improved algorithm for the p-center problem on interval graphs with unit lengths | Authors: | Cheng, TCE Kang, L Ng, CTD |
Issue Date: | Aug-2007 | Source: | Computers and operations research, Aug. 2007, v. 34, no. 8, p. 2215-2222 | Abstract: | The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider this problem by modelling the network as an interval graph whose edges all have unit lengths. We present an O(n) time algorithm for the problem under the assumption that the endpoints of the intervals are sorted, which improves on the existing best algorithm for the problem that has a run time of O(pn). | Keywords: | p-center problem Interval graph Location |
Publisher: | Pergamon Press | Journal: | Computers and operations research | ISSN: | 0305-0548 | EISSN: | 1873-765X | DOI: | 10.1016/j.cor.2005.08.013 | Rights: | Computers & Operations Research © 2005 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com. |
| Appears in Collections: | Journal/Magazine Article |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| p-center4.pdf | Pre-published version | 190.8 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
101
Last Week
0
0
Last month
Citations as of Oct 1, 2023
Downloads
228
Citations as of Oct 1, 2023
SCOPUSTM
Citations
20
Last Week
0
0
Last month
0
0
Citations as of Sep 28, 2023
WEB OF SCIENCETM
Citations
13
Last Week
0
0
Last month
0
0
Citations as of Sep 28, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.