New Frontiers in Parameterized Complexity and Algorithms

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 co...

Celý popis

Uložené v:
Podrobná bibliografia
Médium: E-kniha
Jazyk:English
Vydavateľské údaje: MDPI - Multidisciplinary Digital Publishing Institute 2024
Predmet:
agreement forests
algorithm selection
approximation algorithms
bounded search tree
cascade failure
combinatorial optimisation
comparative genomics
Computer science
Computing and Information Technology
dominating set
enumeration
ETH/SETH
expected coverage
feedback vertex set
fine-grained
fixed-parameter tractability
FPT
fpt-reductions
genome assembly
Hamming distance
haplotyping
hardness of approximation
Heuristics
hitting sets
inapproximability
influence maximization
integer linear programming
kernelization
kidney exchange problem
linear reliable ordering
lower bounds
machine learning
model checking
multilinear monomial detection
ordering
parameterised complexity
parameterised enumeration
parameterized AC0
parameterized algorithm
parameterized complexity
phylogenetics
polynomial hierarchy
probabilistic core
probabilistic graphs
random partitioning
randomized algorithm
sequence analysis
solution diversity
tree decomposition
treedepth
treewidth
turbo-charged
uncertain graphs
vertex cover
ISBN:9783725813025, 3725813019, 9783725813018, 3725813027
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISBN:9783725813025
3725813019
9783725813018
3725813027
DOI:10.3390/books978-3-7258-1302-5