Maximum-cover source location problems with objective edge-connectivity three (Q836873)
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 5602497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum-cover source location problems with objective edge-connectivity three |
scientific article; zbMATH DE number 5602497 |
Statements
Maximum-cover source location problems with objective edge-connectivity three (English)
0 references
9 September 2009
0 references
polynomial-time algorithm
0 references
NP-hard
0 references
0 references
0.89457834
0 references
0.8813048
0 references
0.87895066
0 references
0.87599796
0 references
0.8731954
0 references
0.8720048
0 references
0.87076706
0 references
0.8663249
0 references
