An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers (Q3870690): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59760353, #quickstatements; #temporary_batch_1706287054262 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:35, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers |
scientific article |
Statements
An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers (English)
0 references
1979
0 references
p-centers
0 references
network location
0 references
location of service station
0 references
servicing
0 references
computational complexity
0 references
NP-complete problems
0 references
polynomial algorithm
0 references
graph
0 references
tree
0 references
centers
0 references
medians
0 references
centroid
0 references
w-centroid
0 references
diameter of graph
0 references
dominating set
0 references
min-max criterion
0 references
