Abstract
Given n demand points in the plane, the p-centre problem is to locate p supply points so as to minimize the maximum distance from a demand point to its nearest supply point. Megiddo and Supowit have recently shown that not only is this problem NP-hard, but even finding a close approximate solution to the problem is NP-hard. In this paper we present a polynomial time algorithm for the Euclidean p-centre problem when the demand points are restricted to lie on a fixed number of parallel lines.
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.
