Publication | Closed Access

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

Mathematical ProgrammingComputational Complexity TheoryEngineeringStrongly Polynomial TimeOptimization ProblemCombinatorial ProblemComputational ComplexityTime ComplexityComputer ScienceDiscrete MathematicsCombinatorial OptimizationDiscrete OptimizationApproximation Theory