Fractals for kernelization lower bounds, with an application to length-bounded cut problems (Q4598161)
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: Fractals for kernelization lower bounds, with an application to length-bounded cut problems |
scientific article; zbMATH DE number 6820214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fractals for kernelization lower bounds, with an application to length-bounded cut problems |
scientific article; zbMATH DE number 6820214 |
Statements
19 December 2017
0 references
parameterized complexity
0 references
polynomial-time data reduction
0 references
cross-compositions
0 references
lower bounds
0 references
graph modification problems
0 references
interdiction problems
0 references
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems (English)
0 references
0.9630991816520692
0 references
0.8438384532928467
0 references
0.8394065499305725
0 references
0.786484956741333
0 references
0.7766963243484497
0 references
