Approximation and Parameterized Complexity of Minimax Approval Voting (Q4558792)
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: Approximation and Parameterized Complexity of Minimax Approval Voting |
scientific article; zbMATH DE number 6987099
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation and Parameterized Complexity of Minimax Approval Voting |
scientific article; zbMATH DE number 6987099 |
Statements
Approximation and Parameterized Complexity of Minimax Approval Voting (English)
0 references
30 November 2018
0 references
compitational speed
0 references
computational social choice
0 references
approximation
0 references
