Theoretical complexity of grid cover problems used in radar applications (Q1626552)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Theoretical complexity of grid cover problems used in radar applications |
scientific article; zbMATH DE number 6985510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Theoretical complexity of grid cover problems used in radar applications |
scientific article; zbMATH DE number 6985510 |
Statements
Theoretical complexity of grid cover problems used in radar applications (English)
0 references
27 November 2018
0 references
set cover problem
0 references
grid covering
0 references
combinatorial optimization
0 references
NP-hardness
0 references
radar resource management
0 references
0.7752603888511658
0 references
0.712407648563385
0 references
0.6542775630950928
0 references
0.6485926508903503
0 references
0.6425713300704956
0 references
