Discrete Math Seminar

Graph compression or sparsification is a basic information-theoretic and computational question. A major open problem in this research area is whether $(1+ϵ)$-approximate cut-preserving vertex sparsifiers with size close to the number …