Pages that link to "Item:Q1642801"
From MaRDI portal
The following pages link to Optimal partisan districting on planar geographies (Q1642801):
Displaying 22 items.
- Voting Rights, Markov Chains, and Optimization by Short Bursts (Q58522) (← links)
- On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering (Q782765) (← links)
- Algorithms for gerrymandering over graphs (Q831130) (← 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 political districting (Q1360126) (← links)
- Computational geometric approaches to equitable districting: a survey (Q1980463) (← links)
- A new integer linear programming formulation for the problem of political districting (Q2173126) (← links)
- Fair redistricting is hard (Q2272397) (← links)
- A discrete districting plan (Q2303654) (← links)
- Axiomatic districting (Q2340262) (← links)
- A computational approach to unbiased districting (Q2389779) (← links)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
- Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← links)
- The Self-Limiting Partisan Gerrymander: An Optimization Approach (Q3195423) (← links)
- Partisan gerrymandering with geographically compact districts (Q4611268) (← links)
- The complexity of gerrymandering over graphs: paths and trees (Q5918559) (← links)
- Editorial (Q5970207) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- Priced gerrymandering (Q6093576) (← links)
- Optimality and fairness of partisan gerrymandering (Q6120899) (← links)
- An Exact Solution Method for the Political Districting Problem (Q6135729) (← links)
