On the computational complexity of centers locating in a graph (Q3902477)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of centers locating in a graph |
scientific article |
Statements
1980
0 references
p-median problem
0 references
NP-complete
0 references
communication networks
0 references
m-center problem
0 references
0 references
On the computational complexity of centers locating in a graph (English)
0 references
