Abstract
AbstractThe p‐center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p‐median problem is to locate p facilities on a network so as to minimize the average distance from a demand point to its closest facility. We consider these problems when the network can be modeled by an interval or circular‐arc graph whose edges have unit lengths. We provide, given the interval model of an n vertex interval graph, an O(n) time algorithm for the 1‐median problem on the interval graph. We also show how to solve the p‐median problem, for arbitrary p, on an interval graph in O(pn log n) time and on a circular‐arc graph in O(pn2 log n) time. We introduce a spring representation of the objective function and show how to solve the p‐center problem on a circular‐arc graph in O(pn) time, assuming that the arc endpoints are sorted. © 2002 Wiley Periodicals, Inc.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
