Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability
We study the parameterized complexity of winner determination problems for three prevalent
k-committee selection rules, namely the minimax approval voting (MAV), the proportional …
k-committee selection rules, namely the minimax approval voting (MAV), the proportional …
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses
Max-sat with cardinality constraint (cc-Max-sat) is one of the classical NP-complete
problems. In this problem, given a CNF-formula Φ on n variables, positive integers k, t, the …
problems. In this problem, given a CNF-formula Φ on n variables, positive integers k, t, the …