Connecting the dots (with minimum crossings) (Q5088932)
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: Connecting the dots (with minimum crossings) |
scientific article; zbMATH DE number 7559207
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connecting the dots (with minimum crossings) |
scientific article; zbMATH DE number 7559207 |
Statements
18 July 2022
0 references
crossing minimization
0 references
parameterized complexity
0 references
FPT algorithm
0 references
polynomial kernel
0 references
W[1]-hardness
0 references
0 references
Connecting the dots (with minimum crossings) (English)
0 references
0.7862092852592468
0 references
0.78517085313797
0 references
0.7807537913322449
0 references
0.7767346501350403
0 references
