An Algorithm for Submodular Functions on Graphs
maximum weight common independent set of two matroids
minimum weight covering of directed cuts of a digraph
minimum cost strongly connected orientation
scientific article; zbMATH DE number 3794124