Karger's elegant random contraction algorithm for finding a global mincut in a graph has been highly influential. More recent work has obtained several different (nonuniform) random contraction algorithms for mincut in hypergraphs and hedgegraphs. Motivated by the conceptual goal of understanding these algorithms in a unified fashion, we study random contraction algorithms for finding a minimum quotient of a polymatroid. We introduce the notion of quotient-bounded polymatroids and show that several existing results can be derived and understood under a common algorithmic framework for quotient-bounded polymatroids.

翻译：暂无翻译