NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
We prove NP-hardness of two generalizations of the EDGE COVER problem. We resolve two open questions from the literature regarding the complexity of these two generalizations. We resolve the complexity of three open questions from computational social choice regarding control and bribery for Approval voting.
approval voting computational social choice computational complexity graph problems manipulating elections