NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2015.09.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2152019671 / rank | |||
Normal rank | |||
Revision as of 15:38, 19 March 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
