no code implementations • 23 Feb 2021 • Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
We study the NP-hard Fair Connected Districting problem recently proposed by Stoica et al. [AAMAS 2020]: Partition a vertex-colored graph into k connected components (subsequently referred to as districts) so that in every district the most frequent color occurs at most a given number of times more often than the second most frequent color.
Computer Science and Game Theory Discrete Mathematics
no code implementations • 17 Feb 2021 • Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
Roughly speaking, gerrymandering is the systematic manipulation of the boundaries of electoral districts to make a specific (political) party win as many districts as possible.
Data Structures and Algorithms Discrete Mathematics
