Stable and dynamic minimum cuts

DOI10.1007/978-981-97-0566-5_20MaRDI QIDQ6575402zbMATH OpenFDO

Authors Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma

Publication date 19 July 2024

zbMATH Keywords

stabilityapproximationdynamic minimum cut

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 1617242 (Why is no real title available?)
• Dynamic Steiner Tree Problem
• Fully dynamic exact edge connectivity in sublinear time
• Fully-dynamic bin packing with little repacking
• Fully-dynamic min-cut
• Incremental exact min-cut in polylogarithmic amortized update time
• Maintaining assignments online: matching, scheduling, and flows
• Network flows. Theory, algorithms, and applications.
• Online minimization knapsack problem
• Practical fully dynamic minimum cut algorithms
• Recursive generation of simple planar 5-regular graphs and pentangulations
• Stable approximation algorithms for the dynamic broadcast range-assignment problem
• The power of deferral: maintaining a constant-competitive Steiner tree online
• The power of recourse for online MST and TSP

This page was built for publication: Stable and dynamic minimum cuts

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