Kernelization: Theory of Parameterized Preprocessing

ISBN-10: 1107057760
ISBN-13: 9781107057760
Category: Computers
Pages: 500
Language: English
Published: 2018-12-31
Publisher: Cambridge University Press
Authors: Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov

Description

A complete introduction to recent advances in preprocessing analysis, or kernelization, with extensive examples using a single data set.

Get the book

Similar books

Parameterized Complexity Theory
By J. Flum, M. Grohe
J. Flum, M. Grohe. 9.1 Polynomial Kernelizations Recall that a kernelization of a parameterized problem ( Q , к ) ... kernelization . This suggests a new method for designing fpt - algorithms , which is called the kernelization method ...
Mathematical Theory and Computational Practice: 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009, Proceedings
By Benedikt Lowe, Wolfgang Merkle, Klaus Ambos-Spies
They must be sent to non-isomorphic structures in K. However, no computable structure of high Scott rank can be sent to a computable structure of ... Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy.
Sailing Routes in the World of Computation: 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 –...
By Florin Manea, Russell G. Miller, Dirk Nowotka
14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 – August 3, 2018, Proceedings Florin Manea, Russell G. Miller, ... Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy.
SOFSEM 2019: Theory and Practice of Computer Science: 45th International Conference on Current Trends in Theory and Practice of Computer...
By Barbara Catania, Giovanni Pighizzini, Jerzy Nawrocki
... kernelization exists for the case when the input graph is connected , but that a polynomial kernelization for general graphs is unlikely to exist . The known polynomial Turing kernelization for this problem works on general graphs by ...
Algorithms - ESA 2014: 22th Annual European Symposium, Wrocław, Poland, September 8-10, 2014. Proceedings
By Dorothea Wagner, Andreas S. Schulz
This book constitutes the refereed proceedings of the 22st Annual European Symposium on Algorithms, ESA 2014, held in Wrocław, Poland, in September 2014, as part of ALGO 2014.
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012,...
By Lusheng Wang, Jack Snoeyink, Pinyan Lu
... kernelization algorithm primal-kernelization for the problem (Π, κmax), we can propose a kernelization algorithm for its combinatorial dual (Πc ,κmin), as given in the right column in Table1. Theorem 1. Suppose that (Π, κmax) satisfies ...
Computer Science – Theory and Applications: 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 –...
By Alexander S. Kulikov, Sofya Raskhodnikova
... Kernelization of Same-Size Clustering Sayan Bandyapadhyay1, Fedor V. Fomin1, Petr A. Golovach1, Nidhi Purohit1( B ) ... kernelization k-median · lossy kernels clustering · parameterized approximation · 1 Introduction Lossy kernelization ...
Computing and Combinatorics: 28th International Conference, COCOON 2022, Shenzhen, China, October 22–24, 2022, Proceedings
By Rolf Möhring, Yong Zhang, Dongjing Miao
... kernelization algorithm is called the kernel constructed by the kernelization algorithm. There has been a series of research work on kernelization algorithms for the p-EDS problem. Fernau [11] proposed a kernelization algorithm for p ...
Elements of Dimensionality Reduction and Manifold Learning
By Mark Crowley, Fakhri Karray, Benyamin Ghojogh
... Kernelization. Techniques. Linear algorithms cannot properly handle nonlinear patterns of data. When dealing with nonlinear data, if the algorithm is linear, two solutions exist to ... Kernelization Techniques 61 3.7 Kernelization Techniques.
Ant Colony Optimization and Swarm Intelligence: 5th International Workshop, ANTS 2006, Brussels, Belgium, September 4-7, 2006, Proceedings
By Marco Dorigo
The behavior of parallel ACO is naturally close to the original behavior of natural ants. References 1. Bullnheimer, B., Kotsis, G., Strauß, C.: Parallelization strategies for the ant system. Applied Optimization 24 (1998) 87–100 2.