Vertex sparsifiers and abstract rounding algorithms

DOI10.1109/FOCS.2010.32MaRDI QIDQ6990321zbMATH OpenFDO

Authors Ankur Moitra, Moses Charikar, Shi Li, F. Thomson Leighton

Publication date 29 April 2025

Full work available at URL https://doi.org/10.1109/FOCS.2010.32

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(6)

• Scattering and sparse partitions, and their applications
• Lower bounds on 0-extension with Steiner nodes
• Optimal padded decomposition for bounded treewidth graphs
• Scattering and sparse partitions, and their applications
• Nearly-tight bounds for flow sparsifiers in quasi-bipartite graphs
• Cut-preserving vertex sparsifiers for planar and quasi-bipartite graphs

This page was built for publication: Vertex sparsifiers and abstract rounding algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6990321)