Binary linear programming solutions and non-approximability for control problems in voting systems (Q741772)
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: Binary linear programming solutions and non-approximability for control problems in voting systems |
scientific article; zbMATH DE number 6344105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binary linear programming solutions and non-approximability for control problems in voting systems |
scientific article; zbMATH DE number 6344105 |
Statements
Binary linear programming solutions and non-approximability for control problems in voting systems (English)
0 references
12 September 2014
0 references
graph algorithms
0 references
digraph modification problems
0 references
binary linear programming formulations
0 references
approximation
0 references
computational social choice
0 references
control problems
0 references
voting
0 references
0 references
0.8346512317657471
0 references
0.8346477746963501
0 references
0.8216575384140015
0 references
0.8034089803695679
0 references
0.781424343585968
0 references
