NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461)

From MaRDI portal
Revision as of 22:33, 19 March 2024 by Maintenance script (talk | contribs) (rollbackEdits.php mass rollback)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references