NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting |
scientific article; zbMATH DE number 6515014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting |
scientific article; zbMATH DE number 6515014 |
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
0.740044891834259
0 references
0.740044891834259
0 references
0.7359606027603149
0 references
0.7241881489753723
0 references
0.7176513671875
0 references
