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:

Bibliographic Details
Format:	eBook
Language:	English
Published:	MDPI - Multidisciplinary Digital Publishing Institute 2024
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!