On the Parameterized Complexity of Minimax Approval Voting

  title={On the Parameterized Complexity of Minimax Approval Voting},
  author={Neeldhara Misra and Arshed Nabeel and Harman Singh},
In this work, we initiate a detailed study of the parameterized complexity of Minimax Approval Voting. We demonstrate that the problem is W[2]-hard when parameterized by the size of the committee to be chosen, but does admit a FPT algorithm when parameterized by the number of strings that is more efficient than the previous ILP-based approaches for the problem. We also consider several combinations of parameters and provide a detailed landscape of the parameterized and kernelization complexity… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.


Publications referenced by this paper.

Similar Papers

Loading similar papers…