Winner determination under Conditional Minisum Approval is hard to speed up beyond brute force under SETH/ETH, but becomes polynomial for group-dichotomous ballots or bounded per-voter vertex cover with a constant number of voters.
Parameterized complexity of coloring problems: T reewidth versus vertex cover
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Tractability Landscape of the Conditional Minisum Approval Voting Rule
Winner determination under Conditional Minisum Approval is hard to speed up beyond brute force under SETH/ETH, but becomes polynomial for group-dichotomous ballots or bounded per-voter vertex cover with a constant number of voters.