Corpus ID: 231979168

Gerrymandering on graphs: Computational complexity and parameterized algorithms

@article{Gupta2021GerrymanderingOG,
  title={Gerrymandering on graphs: Computational complexity and parameterized algorithms},
  author={Shivangi Gupta and P. Jain and Fahad Panolan and S. Roy and S. Saurabh},
  journal={ArXiv},
  year={2021},
  volume={abs/2102.09889}
}
The practice of partitioning a region into areas to favor a particular candidate or a party in an election has been known to exist for the last two centuries. This practice is commonly known as gerrymandering. Recently, the problem has also attracted a lot of attention from complexity theory perspective. In particular, Cohen-Zemach et al. [AAMAS 2018] proposed a graph theoretic version of gerrymandering problem and initiated an algorithmic study around this, which was continued by Ito et al… Expand
1 Citations

Figures from this paper

References

SHOWING 1-10 OF 42 REFERENCES
Algorithms for Gerrymandering over Graphs
  • 7
  • Highly Influential
  • PDF
Gerrymandering Over Graphs
  • 11
  • PDF
Narrow sieves for parameterized paths and packings
  • 94
  • PDF
A parameterized view on matroid optimization problems
  • D. Marx
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2009
  • 66
  • PDF
Manipulating Districts to Win Elections: Fine-Grained Complexity
  • 3
  • PDF
How to Find Long Paths Efficiently
  • 159
Parameterized Algorithms
  • 943
  • PDF
Parameterized Computational Complexity of Dodgson and Young Elections
  • 28
  • PDF
...
1
2
3
4
5
...