Cover Image

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

Full description

Saved in:
Format: Online
Language:English
Published: MDPI - Multidisciplinary Digital Publishing Institute 2024
Subjects:
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
tree decomposition
algorithm selection
machine learning
combinatorial optimisation
parameterized AC0
dominating set
inapproximability
integer linear programming
treedepth
solution diversity
hitting sets
vertex cover
feedback vertex set
Hamming distance
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.
approximation algorithms
hardness of approximation
FPT
kernelization
lower bounds
fine-grained
Heuristics
turbo-charged
ETH/SETH
thema EDItEUR::U Computing and Information Technology
thema EDItEUR::U Computing and Information Technology::UY Computer science
Online Access:ONIX_20240704_9783725813018_197
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first

Similar Items