A simple and fast algorithm for fair cuts

DOI10.1007/978-3-031-93112-3_29MaRDI QIDQ6880118zbMATH OpenFDO

Authors Jason Li, Owen Li

Publication date 22 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-93112-3_29

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A deterministic almost-linear time algorithm for minimum-cost flow
• All-pairs max-flow is no harder than single-pair max-flow: Gomory-Hu trees in almost-linear time
• Area-convexity, _ regularization, and undirected multicommodity flow
• Beyond the flow decomposition barrier
• Deterministic min-cut in poly-logarithmic max-flows
• Expander decomposition and pruning: faster, stronger, and simpler
• Faster energy maximization for faster maximum flow
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• Maximal Flow Through a Network
• Maximum flow and minimum-cost flow in almost-linear time
• Near-linear time approximations for cut problems via fair cuts
• Parallel approximate maximum flows in near-linear work and polylogarithmic depth

This page was built for publication: A simple and fast algorithm for fair cuts

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