Near-linear time algorithm for \(n\)-fold ILPs via color coding (Q5138974)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7282385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-linear time algorithm for \(n\)-fold ILPs via color coding |
scientific article; zbMATH DE number 7282385 |
Statements
Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding (English)
0 references
4 December 2020
0 references
near-linear time algorithm
0 references
\(n\)-fold ILP
0 references
color coding
0 references
0 references
0.7973952889442444
0 references
0.7915928363800049
0 references
0.7899933457374573
0 references
0.7861067056655884
0 references
0.7591051459312439
0 references
