On Greedy and Submodular Matrices

DOI10.1007/978-3-642-19754-3_13zbMath1325.90062arXiv1206.5167OpenAlexW2132508746MaRDI QIDQ2999339

Britta Peis, Walter Kern, Ulrich Faigle

Publication date: 12 May 2011

Published in: Theory and Practice of Algorithms in (Computer) Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.5167

zbMATH Keywords

linear programmingsubmodularitymax flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Flows in graphs (05C21)

Related Items

On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond, Greedy oriented flows