Options
Recent advances in practical data reduction
Citation Link: https://doi.org/10.15480/882.4144
Publikationstyp
Preprint
Date Issued
2020
Sprache
English
Institut
TORE-DOI
TORE-URI
Over the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of graph-theoretic problems. This has resulted in an algorithmic toolbox that is by now well-established. However, these theoretical algorithmic ideas have received very little attention from the practical perspective. We survey recent trends in data reduction engineering results for selected problems. Moreover, we describe concrete techniques that may be useful for future implementations in the area and give open problems and research questions.
DDC Class
004: Informatik
Funding Organisations
More Funding Information
Partially supported by DFG grants MN 59/1-1 and SCHU 2567/1-2.
Loading...
Name
2012.12594.pdf
Size
375.57 KB
Format
Adobe PDF