Parameterized complexity of gerrymandering

DOI10.1007/978-3-031-43254-5_8zbMATH Open1539.91109MaRDI QIDQ6546281FDOQ6546281

Authors: Andrew Fraser, Brian Lavallee, Blair D. Sullivan 

Publication date: 29 May 2024

Recommendations

• Gerrymandering on graphs: computational complexity and parameterized algorithms
• The complexity of gerrymandering over graphs: paths and trees
• Algorithms for gerrymandering over graphs
• Priced gerrymandering
• Optimal partisan districting on planar geographies

zbMATH Keywords

gerrymanderinggraph algorithmsparameterized complexity

Mathematics Subject Classification ID

History, political science (91F10) Voting theory (91B12) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Parametrized complexity theory.
• Parameterized algorithms
• Algorithms for gerrymandering over graphs
• Structured proportional representation
• Gerrymandering on graphs: computational complexity and parameterized algorithms
• The complexity of gerrymandering over graphs: paths and trees

This page was built for publication: Parameterized complexity of gerrymandering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546281)