Abstract
PMP is a well-known NP-hard problem with extensively wide applications in location science and clustering. In this paper, we presented computational complexity results about the backbone, the shared common parts of all the optimal solutions to the PMP. We showed that it is intractable to approximate the backbone of the PMP with any performance guarantee under the assumption that P ≠ NP. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Jiang, H., Zhang, X., & Li, M. (2007). Backbone of the p-median problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4830 LNAI, pp. 699–704). Springer Verlag. https://doi.org/10.1007/978-3-540-76928-6_78
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
