NP-completeness of some type of p-center problem

DOI10.1016/0166-218X(80)90034-7zbMath0452.90025MaRDI QIDQ1148783

Yoshiaki Kakuda, Tohru Kikuno, Noriyoshi Yoshida

Publication date: 1980

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

zbMATH Keywords

computational complexityshortest pathNP-completenesslogisticsconnected 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)

Related Items (1)

Algorithmic aspects of upper edge domination

Cites Work

• Unnamed Item
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers

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