Corrigendum to: ``Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares'' (Q2285159)
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: Corrigendum to: ``Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares |
scientific article; zbMATH DE number 7152284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Corrigendum to: ``Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares'' |
scientific article; zbMATH DE number 7152284 |
Statements
Corrigendum to: ``Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares'' (English)
0 references
16 January 2020
0 references
two-center problem
0 references
hitting line segments by two axis-parallel squares
0 references
0.7714024186134338
0 references
0.7502443194389343
0 references
0.7469586730003357
0 references
0.7147831320762634
0 references
