NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461): Difference between revisions
From MaRDI portal
Latest revision as of 04:07, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting |
scientific article |
Statements
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (English)
0 references
1 December 2015
0 references
computational complexity
0 references
computational social choice
0 references
graph problems
0 references
manipulating elections
0 references
approval voting
0 references
0 references