• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

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

Robert BredereckNimrod Talmon
Published in: Inf. Process. Lett. (2016)
Keyphrases
  • np hardness
  • np hard
  • voting rules
  • approximation algorithms
  • worst case analysis
  • training data
  • control system