Deterministic Minimum Steiner Cut in Maximum Flow Time

Matthew Ding, Jason Li

We devise a deterministic algorithm for minimum Steiner cut, which uses $(\log n{)}^{O(1)}$ maximum flow calls and additional near-linear time. This algorithm improves on Li and Pani…