Stable and dynamic minimum cuts

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

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

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• Dynamic Steiner Tree Problem
• Fully-dynamic bin packing with little repacking
• Maintaining assignments online: matching, scheduling, and flows
• The power of deferral: maintaining a constant-competitive Steiner tree online
• Online minimization knapsack problem
• The power of recourse for online MST and TSP
• Fully-dynamic min-cut
• Incremental exact min-cut in polylogarithmic amortized update time
• Recursive generation of simple planar 5-regular graphs and pentangulations
• 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

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