| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949714 | Discrete Applied Mathematics | 2017 | 27 Pages |
Abstract
We complement our algorithms by lower bounds on the running time of exact algorithms and on the effectivity of data reduction.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, OndÅej Suchý,