An FPT algorithm beating 2-approximation for \(k\)-cut (Q4608074)
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: An FPT algorithm beating 2-approximation for k-cut |
scientific article; zbMATH DE number 6850487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An FPT algorithm beating 2-approximation for \(k\)-cut |
scientific article; zbMATH DE number 6850487 |
Statements
15 March 2018
0 references
0.828087329864502
0 references
0.8048098683357239
0 references
0.7926653027534485
0 references
0.792228102684021
0 references
0.7838627696037292
0 references
