Faster exact algorithms for hard problems: A parameterized point of view
From MaRDI portal
Publication:5931443
DOI10.1016/S0012-365X(00)00199-0zbMath0973.68256OpenAlexW2020133533MaRDI QIDQ5931443
Jens Gramm, Jochen Alber, Rolf Niedermeier
Publication date: 5 July 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00199-0
Related Items (19)
Moving policies in cyclic assembly line scheduling ⋮ A fixed-parameter algorithm for minimum quartet inconsistency ⋮ On the existence of subexponential parameterized algorithms ⋮ Graph separators: A parameterized view ⋮ Computing the similarity of two sequences with nested arc annotations ⋮ Optimal 2-constraint satisfaction via sum-product algorithms ⋮ A top-down approach to search-trees: Improved algorithmics for 3-hitting set ⋮ An efficient fixed-parameter algorithm for 3-hitting set ⋮ Identification of function distinguishable languages. ⋮ An efficient solver for weighted Max-SAT ⋮ Dealing with 4-variables by resolution: an improved MaxSAT algorithm ⋮ Exact Algorithms for MAX-SAT ⋮ Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs ⋮ Computing the maximum agreement of phylogenetic networks ⋮ Exact Max-SAT solvers for over-constrained problems ⋮ A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem ⋮ Parameterized Complexity ⋮ A new algorithm for optimal 2-constraint satisfaction and its implications ⋮ An Empirical Study of MAX-2-SAT Phase Transitions
This page was built for publication: Faster exact algorithms for hard problems: A parameterized point of view
