Fast approximation algorithms for cut-based problems in undirected graphs

DOI10.1109/FOCS.2010.30MaRDI QIDQ6990323zbMATH OpenFDO

Authors Aleksander Mądry

Publication date 29 April 2025

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

Mathematics Subject Classification ID

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

Cited in

(3)

• Optimal electrical oblivious routing on expanders
• Maximum flow and minimum-cost flow in almost-linear time
• Almost-linear-time weighted _p-norm solvers in slightly dense graphs via sparsification

This page was built for publication: Fast approximation algorithms for cut-based problems in undirected graphs

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