Optimizing Districting Plans to Maximize Majority-Minority Districts via IPs and Local Search
Fuente:
arXiv
Guardado en:
| Autores principales: | Brous, Daniel, Shmoys, David |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Drawing Competitive Districts in Redistricting
por: Chuang, Gabriel, et al.
Publicado: (2024)
por: Chuang, Gabriel, et al.
Publicado: (2024)
Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
por: Chang, Claire, et al.
Publicado: (2026)
por: Chang, Claire, et al.
Publicado: (2026)
Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General
por: Shmoys, David, et al.
Publicado: (2026)
por: Shmoys, David, et al.
Publicado: (2026)
Packing Compact Subgraphs with Applications to Districting
por: Chen, Ho-Lin, et al.
Publicado: (2026)
por: Chen, Ho-Lin, et al.
Publicado: (2026)
Hardness and Approximation Algorithms for Balanced Districting Problems
por: Dharangutte, Prathamesh, et al.
Publicado: (2025)
por: Dharangutte, Prathamesh, et al.
Publicado: (2025)
Fairness in Streaming Submodular Maximization over a Matroid Constraint
por: Halabi, Marwa El, et al.
Publicado: (2023)
por: Halabi, Marwa El, et al.
Publicado: (2023)
Balanced Spanning Tree Distributions Have Separation Fairness
por: Chen, Harry, et al.
Publicado: (2025)
por: Chen, Harry, et al.
Publicado: (2025)
Ranking with Partitioning
por: Boardman, Samuel
Publicado: (2026)
por: Boardman, Samuel
Publicado: (2026)
Construction and Preliminary Validation of a Dynamic Programming Concept Inventory
por: Ferland, Matthew, et al.
Publicado: (2024)
por: Ferland, Matthew, et al.
Publicado: (2024)
Local dominance unveils clusters in networks
por: Shi, Dingyi, et al.
Publicado: (2022)
por: Shi, Dingyi, et al.
Publicado: (2022)
K-stars LDP: A Novel Framework for (p, q)-clique Enumeration under Local Differential Privacy
por: Sun, Henan, et al.
Publicado: (2024)
por: Sun, Henan, et al.
Publicado: (2024)
Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
por: Salem, Jad, et al.
Publicado: (2024)
por: Salem, Jad, et al.
Publicado: (2024)
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
por: Esmer, Barış Can, et al.
Publicado: (2022)
por: Esmer, Barış Can, et al.
Publicado: (2022)
Synthetic Census Data Generation via Multidimensional Multiset Sum
por: Dwork, Cynthia, et al.
Publicado: (2024)
por: Dwork, Cynthia, et al.
Publicado: (2024)
Local Search k-means++ with Foresight
por: Conrads, Theo, et al.
Publicado: (2024)
por: Conrads, Theo, et al.
Publicado: (2024)
Explaining Rankings with Hidden Group Bonuses
por: Yan, Alvin Hong Yao, et al.
Publicado: (2026)
por: Yan, Alvin Hong Yao, et al.
Publicado: (2026)
Scalable Fair Influence Blocking Maximization via Approximately Monotonic Submodular Optimization
por: Fang, Qiangpeng, et al.
Publicado: (2026)
por: Fang, Qiangpeng, et al.
Publicado: (2026)
Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
por: Buchbinder, Niv, et al.
Publicado: (2025)
por: Buchbinder, Niv, et al.
Publicado: (2025)
Complexity of Local Search for Euclidean Clustering Problems
por: Manthey, Bodo, et al.
Publicado: (2023)
por: Manthey, Bodo, et al.
Publicado: (2023)
The Query Complexity of Local Search and Brouwer in Rounds
por: Brânzei, Simina, et al.
Publicado: (2020)
por: Brânzei, Simina, et al.
Publicado: (2020)
Fun Maximizing Search, (Non) Instance Optimality, and Video Games for Parrots
por: Barbay, Jérémy
Publicado: (2024)
por: Barbay, Jérémy
Publicado: (2024)
Continuous Fairness On Data Streams
por: Ghosh, Subhodeep, et al.
Publicado: (2026)
por: Ghosh, Subhodeep, et al.
Publicado: (2026)
The Query Complexity of Local Search in Rounds on General Graphs
por: Brânzei, Simina, et al.
Publicado: (2026)
por: Brânzei, Simina, et al.
Publicado: (2026)
Single-Criteria Metric $r$-Dominating Set Problem via Minor-Preserving Support
por: Browne, Reilly, et al.
Publicado: (2026)
por: Browne, Reilly, et al.
Publicado: (2026)
Maximizing Reachability via Shifting of Temporal Paths
por: Deligkas, Argyrios, et al.
Publicado: (2026)
por: Deligkas, Argyrios, et al.
Publicado: (2026)
Maximizing Weighted Dominance in the Plane
por: Akram, Waseem, et al.
Publicado: (2024)
por: Akram, Waseem, et al.
Publicado: (2024)
Maximization of Approximately Submodular Functions
por: Horel, Thibaut, et al.
Publicado: (2024)
por: Horel, Thibaut, et al.
Publicado: (2024)
On Detecting $H$-Induced Minors for Small $H$
por: Eagling-Vose, Tala, et al.
Publicado: (2026)
por: Eagling-Vose, Tala, et al.
Publicado: (2026)
Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
por: Balzereit, Kaja, et al.
Publicado: (2024)
por: Balzereit, Kaja, et al.
Publicado: (2024)
Differentially Private Release of Israel's National Registry of Live Births
por: Hod, Shlomi, et al.
Publicado: (2024)
por: Hod, Shlomi, et al.
Publicado: (2024)
A Scalable Algorithm for Individually Fair K-means Clustering
por: Bateni, MohammadHossein, et al.
Publicado: (2024)
por: Bateni, MohammadHossein, et al.
Publicado: (2024)
Correcting Underrepresentation and Intersectional Bias for Classification
por: Diana, Emily, et al.
Publicado: (2023)
por: Diana, Emily, et al.
Publicado: (2023)
Fairness Implications of Encoding Protected Categorical Attributes
por: Mougan, Carlos, et al.
Publicado: (2022)
por: Mougan, Carlos, et al.
Publicado: (2022)
Fair Submodular Cover
por: Chen, Wenjing, et al.
Publicado: (2024)
por: Chen, Wenjing, et al.
Publicado: (2024)
Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
por: Funk, Nicole, et al.
Publicado: (2026)
por: Funk, Nicole, et al.
Publicado: (2026)
Matchings, Predictions and Counterfactual Harm in Refugee Resettlement Processes
por: Lee, Seungeon, et al.
Publicado: (2024)
por: Lee, Seungeon, et al.
Publicado: (2024)
Error-Tolerant E-Discovery Protocols
por: Dong, Jinshuo, et al.
Publicado: (2024)
por: Dong, Jinshuo, et al.
Publicado: (2024)
Time Fairness in Online Knapsack Problems
por: Lechowicz, Adam, et al.
Publicado: (2023)
por: Lechowicz, Adam, et al.
Publicado: (2023)
The Complexity of Maximal Common Subsequence Enumeration
por: Buzzega, Giovanni, et al.
Publicado: (2025)
por: Buzzega, Giovanni, et al.
Publicado: (2025)
Local Search for Clustering in Almost-linear Time
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2025)
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2025)
Ejemplares similares
-
Drawing Competitive Districts in Redistricting
por: Chuang, Gabriel, et al.
Publicado: (2024) -
Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
por: Chang, Claire, et al.
Publicado: (2026) -
Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General
por: Shmoys, David, et al.
Publicado: (2026) -
Packing Compact Subgraphs with Applications to Districting
por: Chen, Ho-Lin, et al.
Publicado: (2026) -
Hardness and Approximation Algorithms for Balanced Districting Problems
por: Dharangutte, Prathamesh, et al.
Publicado: (2025)