Chamberlin--Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time
From MaRDI portal
Publication:4596723
DOI10.1613/jair.5628zbMath1423.68601OpenAlexW2772354143MaRDI QIDQ4596723
Piotr Faliszewski, Piotr Skowron
Publication date: 8 December 2017
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.5628
Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12) Approximation algorithms (68W25)
Related Items
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives ⋮ FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective ⋮ Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems ⋮ Polynomial-time data reduction for weighted problems beyond additive goal functions ⋮ Complexity of manipulative interference in participatory budgeting ⋮ Preference elicitation and robust winner determination for single- and multi-winner social choice ⋮ Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
