Backbone of the p-median problem

Authors:
He Jiang;XianChao Zhang;MingChu Li
Affiliations:
School of Software, Dalian University of Technology, Dalia, P.R. China;School of Software, Dalian University of Technology, Dalia, P.R. China;School of Software, Dalian University of Technology, Dalia, P.R. China
Venue:
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Year:
2007

Citing 1
Cited 0

The backbone of the travelling salesperson

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

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.