A Note on Isolating Cut Lemma for Submodular Function Minimization
Data Structures and Algorithms
2021-03-30 v1
Abstract
It has been observed independently by many researchers that the isolating cut lemma of Li and Panigrahi [FOCS 2020] can be easily extended to obtain new algorithms for finding the non-trivial minimizer of a symmetric submodular function and solving the hypergraph minimum cut problem. This note contains these observations.
Cite
@article{arxiv.2103.15724,
title = {A Note on Isolating Cut Lemma for Submodular Function Minimization},
author = {Sagnik Mukhopadhyay and Danupon Nanongkai},
journal= {arXiv preprint arXiv:2103.15724},
year = {2021}
}