A Strongly Polynomial-Time Algorithm for Minimizing Submodular Functions.

This paper presents a combinatorial polynomial-time algorithm for minimizing submodular set functions. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter.

MoreLess

Year of publication:	1999
Authors:	Iwata, S. ; Fleischer, L. ; Fujishige, S.
Institutions:	Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain
Subject:	OPTIMIZATION \| MATHEMATICAL ANALYSIS

Check Google Scholar |

More access options

In German libraries (KVK)

I need help

More details

Series:	Papers.
Type of publication:	Book / Working Paper
Notes:	16 pages
Classification:	C00 - Mathematical and Quantitative Methods. General ; C60 - Mathematical Methods and Programming. General
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005779433