Reprint

New Frontiers in Parameterized Complexity and Algorithms

Edited by
June 2024
272 pages
  • ISBN978-3-7258-1301-8 (Hardback)
  • ISBN978-3-7258-1302-5 (PDF)

This book is a reprint of the Special Issue New Frontiers in Parameterized Complexity and Algorithms that was published in

Computer Science & Mathematics
Summary

The research on parameterized complexity (PC), described in these peer-reviewed chapters by esteemed researchers, provides ties to practice as well as new theoretical developments, many in the direction of AI. Applications in bioinformatics and social choice are described, as well as faster, less costly approximation methods and new techniques using machine learning to find treewidth and other metrics. Many practical problems can be solved by harnessing the power of both PC and SAT solvers or integer linear programming modeled by parameterized graph problems. The extremely rapid development and deployment of PC continues to bring fresh understanding and solutions to fundamental open questions.

Format
  • Hardback
License and Copyright
© 2024 by the authors; CC BY-NC-ND license
Keywords
kidney exchange problem; randomized algorithm; parameterized algorithm; random partitioning; multilinear monomial detection; fixed-parameter tractability; treewidth; model checking; parameterized complexity; polynomial hierarchy; fpt-reductions; parameterised complexity; enumeration; bounded search tree; parameterised enumeration; ordering; treewidth; tree decomposition; algorithm selection; machine learning; combinatorial optimisation; parameterized AC0; dominating set; inapproximability; integer linear programming; parameterized complexity; treewidth; treedepth; solution diversity; fixed-parameter tractability; hitting sets; vertex cover; feedback vertex set; Hamming distance; fixed-parameter tractability; genome assembly; sequence analysis; comparative genomics; haplotyping; phylogenetics; agreement forests; probabilistic graphs; uncertain graphs; influence maximization; cascade failure; linear reliable ordering; expected coverage; probabilistic core.; parameterized complexity; approximation algorithms; hardness of approximation; FPT; parameterized complexity; kernelization; lower bounds; fine-grained; Heuristics; turbo-charged; ETH/SETH

Related Books

October 2020

Symmetry and Complexity 2019

Computer Science & Mathematics
...
October 2023

Quantum Computing Algorithms and Computational Complexity

Computer Science & Mathematics
March 2022

Graph Algorithms and Applications

Computer Science & Mathematics
October 2020

Symmetry and Complexity

Computer Science & Mathematics
...
March 2024

Recent Advances of Disсrete Optimization and Scheduling

Computer Science & Mathematics