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 
Keywords: p-center problem
Interval graph
Location
Issue Date: Aug-2007
Publisher: Pergamon Press
Source: Computers and operations research, Aug. 2007, v. 34, no. 8, p. 2215-2222 How to cite?
Journal: Computers and operations research 
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).
URI: http://hdl.handle.net/10397/655
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 SizeFormat 
p-center4.pdfPre-published version190.8 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

15
Last Week
0
Last month
0
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

11
Last Week
0
Last month
0
Citations as of Aug 21, 2017

Page view(s)

420
Last Week
6
Last month
Checked on Aug 21, 2017

Download(s)

1,157
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.