Chain length characterizes multiplicative sparsifiability of set systems, shown via a generalized contraction algorithm that simplifies earlier proofs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multiplicative error set system sparsification: A simpler proof via chain length contraction
Chain length characterizes multiplicative sparsifiability of set systems, shown via a generalized contraction algorithm that simplifies earlier proofs.