A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
type: Item
instance of: scholarly article
title: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
zbMATH Open document ID: 1052.90067
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/2108
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1843733
Wikidata QID: Q62111283
MaRDI profile type: Publication
OpenAlex ID: W2035575256
cites work: The Partial Order of a Polymatroid Extreme Point
cites work: Testing membership in matroid polyhedra
cites work: On submodular function minimization
cites work: Q5684698
cites work: Finding feasible vectors of Edmonds-Giles polyhedra
cites work: Submodular functions and optimization
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Geometric algorithms and combinatorial optimization
cites work: Q4761871
cites work: Computing Maximal “Polymatroidal” Network Flows
cites work: Q3682236
cites work: Maximal Closure of a Graph and Applications to Combinatorial Problems
cites work: Minimizing symmetric submodular functions
cites work: A Selection Problem of Shared Fixed Costs and Network Flows
DOI: 10.1006/JCTB.2000.1989
Recommended article: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
Recommended article: A fully combinatorial algorithm for submodular function minimization.
Recommended article: A faster strongly polynomial time algorithm for submodular function minimization
Recommended article: A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
Recommended article: Q4633938
Recommended article: Q4829030
Recommended article: A strongly polynomial time algorithm for a constrained submodular optimization problem
Recommended article: Q4877181
Recommended article: Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
author: Alexander Schrijver
description: scientific article; zbMATH DE number 1843733