NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
DOI10.1016/j.ipl.2015.09.008zbMath1346.68101WikidataQ62039068 ScholiaQ62039068MaRDI QIDQ894461
Robert Bredereck, Nimrod Talmon
Publication date: 1 December 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2015.09.008
computational complexity; computational social choice; approval voting; graph problems; manipulating elections
68Q25: Analysis of algorithms and problem complexity
05C90: Applications of graph theory
91B12: Voting theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
91B14: Social choice
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Graph factors and factorization: 1985--2003: a survey
- Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
- General factors of graphs
- How hard is it to control an election?
- Swap Bribery
- How Hard Is Bribery in Elections?
- Reducibility among Combinatorial Problems
- Control and Bribery in Voting
