Nearly time-optimal kernelization algorithms for the line-cover problem with big data (Q6586656)
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: Nearly time-optimal kernelization algorithms for the line-cover problem with big data |
scientific article; zbMATH DE number 7896130
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearly time-optimal kernelization algorithms for the line-cover problem with big data |
scientific article; zbMATH DE number 7896130 |
Statements
Nearly time-optimal kernelization algorithms for the line-cover problem with big data (English)
0 references
13 August 2024
0 references
line cover
0 references
kernelization algorithm
0 references
NP-complete geometric problem
0 references
parameterized computation
0 references
0 references
