On the complexity of and algorithms for min-max target coverage on a line boundary (Q2327482)
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: On the complexity of and algorithms for min-max target coverage on a line boundary |
scientific article; zbMATH DE number 7117284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of and algorithms for min-max target coverage on a line boundary |
scientific article; zbMATH DE number 7117284 |
Statements
On the complexity of and algorithms for min-max target coverage on a line boundary (English)
0 references
15 October 2019
0 references
0.8264041543006897
0 references
Q368758 (Deleted Item)
0.8175359964370728
0 references
Q368758 (Deleted Item)
0.8170411586761475
0 references
0.812533974647522
0 references
0.809823215007782
0 references
