Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability.

Tanmay Inamdar Daniel Lokshtanov Saket Saurabh Vaishali Surianarayanan

Published in: CoRR (2023)

Keyphrases

parameterized complexity
fixed parameter tractable
vertex set
computational problems
np hard
np complete
global constraints
approximation algorithms
bounded treewidth
conjunctive queries
special case
lower bound
linear programming
weighted graph