Near-linear time approximations for cut problems via fair cuts

DOI10.1137/1.9781611977554.CH10MaRDI QIDQ6538536zbMATH OpenFDO

Authors Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak

Publication date 14 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows

This page was built for publication: Near-linear time approximations for cut problems via fair cuts

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