NP-completeness of some type of p-center problem

DOI10.1016/0166-218X(80)90034-7MaRDI QIDQ1148783zbMATH OpenFDO

Authors Tohru Kikuno, N. Yoshida, Yoshiaki Kakuda

Publication date 1980

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

computational complexitylogisticsNP-completenessshortest pathconnected undirected graphbounded vertex s-center problemcomputer-communication netsnetwork location problemvertex p-center problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Inventory, storage, reservoirs (90B05)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers

Cited in

(1)

• Algorithmic aspects of upper edge domination

This page was built for publication: NP-completeness of some type of p-center problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148783)