Greedy oriented flows
From MaRDI portal
Publication:1751094
DOI10.1007/s00453-017-0306-4zbMath1397.90384OpenAlexW2598178608WikidataQ59529252 ScholiaQ59529252MaRDI QIDQ1751094
Ulrich Faigle, Walter Kern, Britta Peis
Publication date: 23 May 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0306-4
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic flows in regular matroids
- Principal structures of submodular systems
- Linear programming duality: an introduction to oriented matroids
- Increasing the rooted connectivity of a digraph by one
- On structures of bisubmodular polyhedra
- A ranking model for the greedy algorithm and discrete convexity
- Submodular functions and optimization.
- On Greedy and Submodular Matrices
- Maximal Flow Through a Network
- An O (n log n) algorithm for maximum st-flow in a directed planar graph
- Totally-Balanced and Greedy Matrices
- Minimal cost flows in regular matroids
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
- A Characterization of Nonnegative Box-Greedy Matrices
- Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data
- Bisubmodular Function Minimization