Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees (Q4302935)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 622431
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees |
scientific article; zbMATH DE number 622431 |
Statements
Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees (English)
0 references
1 March 1995
0 references
uncapacitated \(p\)-center problem
0 references
NP-hard
0 references
polynomial algorithms
0 references
tree network
0 references
capacitated \(p\)-center problem on trees
0 references
capacitated covering problem
0 references
vertex center problem
0 references
absolute center problem
0 references
0.8094656467437744
0 references
0.8090006113052368
0 references
0.807852029800415
0 references
0.8050019145011902
0 references
