Login / Signup
An optimal FPT algorithm parametrized by treewidth for Weighted-Max-Bisection given a tree decomposition as advice assuming SETH and the hardness of MinConv.
Hauke Brinkop
Klaus Jansen
Tim Weißenfels
Published in:
CoRR (2021)
Keyphrases
</>
worst case
tree decomposition
search space
np hard
dynamic programming
computational complexity
space complexity
optimal solution
linear programming
evolutionary algorithm
special case
particle swarm optimization
np complete
decomposition method