On the complexity of Chamberlin-Courant on almost structured profiles

DOI10.1007/978-3-319-67504-6_9zbMath1398.91235OpenAlexW2757827805MaRDI QIDQ1990291

Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan

Publication date: 25 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-67504-6_9

zbMATH Keywords

NP-hardnessvoting rulesfixed-parameter algorithmsChamberlin Courantsingle-crossing profilessingle-peaked profiles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12)

Related Items (3)

A characterization of the single-peaked single-crossing domain ⋮ Polynomial-time data reduction for weighted problems beyond additive goal functions ⋮ On the parameterized complexity of party nominations

This page was built for publication: On the complexity of Chamberlin-Courant on almost structured profiles