On the Complexity of Some Common Geometric Location Problems (Q3318110)
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 3848611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Some Common Geometric Location Problems |
scientific article; zbMATH DE number 3848611 |
Statements
On the Complexity of Some Common Geometric Location Problems (English)
0 references
1984
0 references
computational geometry
0 references
p-center problem
0 references
p-median problem
0 references
NP-hard
0 references
0.8521903157234192
0 references
0.8472948670387268
0 references
0.8399233818054199
0 references
0.8362753987312317
0 references
0.8347062468528748
0 references
