Stable and dynamic minimum cuts

DOI10.1007/978-981-97-0566-5_20MaRDI QIDQ6575402

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

Publication date: 19 July 2024

zbMATH Keywords

stabilityapproximationdynamic minimum cut

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Fully-dynamic min-cut
• Recursive generation of simple planar 5-regular graphs and pentangulations
• Online Minimization Knapsack Problem
• Dynamic Steiner Tree Problem
• Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
• Fully-Dynamic Bin Packing with Little Repacking
• Maintaining Assignments Online: Matching, Scheduling, and Flows
• The power of deferral
• The Power of Recourse for Online MST and TSP
• Fully dynamic exact edge connectivity in sublinear time
• Practical fully dynamic minimum cut algorithms
• Stable approximation algorithms for the dynamic broadcast range-assignment problem

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