Imagen de Portada

A Uniformly Random Solution to Algorithmic Redistricting

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cai, Jin-Yi, Kruse, Jacob, Mayer, Kenneth, Szabo, Daniel P.
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Holey graphs: very large Betti numbers are testable
por: Szabó, Dániel, et al.
Publicado: (2024)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
por: Jana, Satyabrata, et al.
Publicado: (2025)

Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
por: von Bergen, Hanno, et al.
Publicado: (2026)

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
por: Dudeja, Aditi, et al.
Publicado: (2024)

Tight Bounds for Sparsifying Random CSPs
por: Brakensiek, Joshua, et al.
Publicado: (2025)

A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
por: Iwata, Satoru, et al.
Publicado: (2024)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
por: Bourneuf, Romain, et al.
Publicado: (2025)

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
por: Bourneuf, Romain, et al.
Publicado: (2025)

A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
por: Shakeri, Heman, et al.
Publicado: (2025)

Stable Approximation Algorithms for Dominating Set and Independent Set
por: de Berg, Mark, et al.
Publicado: (2024)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
por: Chakraborty, Dibyayan, et al.
Publicado: (2024)

Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
por: Kita, Nanano
Publicado: (2025)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
por: Ghanbari, Babak, et al.
Publicado: (2026)

Twin-width one
por: Ahn, Jungho, et al.
Publicado: (2025)

Hardness of Burning Number Problem on Regular Graphs
por: Antony, Dhanyamol, et al.
Publicado: (2026)

Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
por: Neuen, Daniel
Publicado: (2020)

Isomorphism Testing Parameterized by Genus and Beyond
por: Neuen, Daniel
Publicado: (2021)

Robust Contraction Decomposition for Minor-Free Graphs and its Applications
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)

Colouring Probe $H$-Free Graphs
por: Paulusma, Daniël, et al.
Publicado: (2025)

Induced Minors and Coarse Tree Decompositions
por: Chudnovsky, Maria, et al.
Publicado: (2026)

Tree Independence Number IV. Even-hole-free Graphs
por: Chudnovsky, Maria, et al.
Publicado: (2024)

Bounding Width on Graph Classes of Constant Diameter
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Reconfiguration of List Colourings
por: Cambie, Stijn, et al.
Publicado: (2025)

The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
por: Chen, Yeyuan
Publicado: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
por: Kunisky, Dmitriy, et al.
Publicado: (2023)

A characterization of testable hypergraph properties
por: Joos, Felix, et al.
Publicado: (2017)

A logarithmic approximation of linearly ordered colourings
por: Håstad, Johan, et al.
Publicado: (2024)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
por: Bernshteyn, Anton, et al.
Publicado: (2024)

A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
por: Chang, Yeonsu, et al.
Publicado: (2023)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
por: Bencs, Ferenc, et al.
Publicado: (2024)

Approximating maximum-size properly colored forests
por: Bai, Yuhang, et al.
Publicado: (2024)

Problems on Group-labeled Matroid Bases
por: Hörsch, Florian, et al.
Publicado: (2024)

$α_i$-Metric Graphs: Hyperbolicity
por: Dragan, Feodor F., et al.
Publicado: (2024)

Rainbow Arborescence Conjecture
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
por: Holtgrefe, Niels, et al.
Publicado: (2024)

Cuts in Graphs with Matroid Constraints
por: Banik, Aritra, et al.
Publicado: (2024)

Deterministic approximation for the volume of the truncated fractional matching polytope
por: Guo, Heng, et al.
Publicado: (2024)

Clique-free t-matchings in degree-bounded graphs
por: Paluch, Katarzyna, et al.
Publicado: (2024)

On the sizes of BDDs and ZDDs representing matroids
por: Emoto, Hiromi, et al.
Publicado: (2024)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
por: Korhonen, Tuukka, et al.
Publicado: (2024)