Aspects of Preprocessing
Applied to Combinatorial Graph Problems
Size: 195 pages
Publishing year: 2013
ISBN 978-3-7983-2508-1Publishing year: 2013
12,00 €
This work considers multiple aspects of efficient (that is, polynomial-time executable) preprocessing for NP-hard problems in the context of parameterized complexity theory. Special emphasis is put on the following topics: Non-standard parameterization, linear-time kernelization, preprocessing beyond kernelization, and parallelizable Turing kernelization. All these topics are practically relevant and, pioneering work on parallelizable Turing kernelizations, the final topic is of special theoretical interest.