NP-completeness of some type of p-center problem (Q1148783)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NP-completeness of some type of p-center problem |
scientific article; zbMATH DE number 3708076
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness of some type of p-center problem |
scientific article; zbMATH DE number 3708076 |
Statements
NP-completeness of some type of p-center problem (English)
0 references
1980
0 references
logistics
0 references
network location problem
0 references
vertex p-center problem
0 references
connected undirected graph
0 references
NP-completeness
0 references
bounded vertex s-center problem
0 references
computer-communication nets
0 references
shortest path
0 references
computational complexity
0 references
