An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers (Q3870690): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0137040 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4239852074 / rank | |||
Normal rank | |||
Latest revision as of 18:21, 19 March 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
