works on
approximation hardness 1communication delays 1hypergraph coloring 1precedence constraints 1scheduling 1

From the 1 of 48 linked papers with an AI index.

activity
20242026
most citedRedundancy Is All You Need (for CSP Sparsification)

1 citations · 1 across the 15 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2026

Multiplicative error set system sparsification: A simpler proof via chain length contraction

Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman

The chain length of a set family is the largest ascending sequence of sets in containment order in the union-closure of . In this work,…