Pages that link to "Item:Q2389779"
From MaRDI portal
The following pages link to A computational approach to unbiased districting (Q2389779):
Displaying 14 items.
- Voting Rights, Markov Chains, and Optimization by Short Bursts (Q58522) (← links)
- A fair division solution to the problem of redistricting (Q733796) (← links)
- Bicolored graph partitioning, or: gerrymandering at its worst (Q967425) (← links)
- Optimal redistricting under geographical constraints: why ``pack and crack'' does not work (Q1046263) (← links)
- Optimal partisan districting on planar geographies (Q1642801) (← links)
- Computational geometric approaches to equitable districting: a survey (Q1980463) (← links)
- Fair redistricting is hard (Q2272397) (← links)
- A discrete districting plan (Q2303654) (← links)
- Axiomatic districting (Q2340262) (← links)
- Network-Based Dissolution (Q2922597) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- Priced gerrymandering (Q6093576) (← links)
- An Exact Solution Method for the Political Districting Problem (Q6135729) (← links)