Greedy oriented flows

DOI10.1007/S00453-017-0306-4MaRDI QIDQ1751094zbMATH OpenOpenAlexWikidataFDO

Authors U. Faigle, Walter Kern, Britta Peis

Publication date 23 May 2018

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00453-017-0306-4

zbMATH Keywords

greedy algorithmregular matroidmax flowcycle cancelling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Recommendations

• Greedy concepts for network flow problems
• scientific article; zbMATH DE number 3970528
• On greedy algorithms for series parallel graphs
• A new approach to the maximum-flow problem
• scientific article; zbMATH DE number 1029233

Cites work

• scientific article; zbMATH DE number 3885621 (Why is no real title available?)
• scientific article; zbMATH DE number 5764848 (Why is no real title available?)
• scientific article; zbMATH DE number 53152 (Why is no real title available?)
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 1845876 (Why is no real title available?)
• scientific article; zbMATH DE number 3227800 (Why is no real title available?)
• A Characterization of Nonnegative Box-Greedy Matrices
• A ranking model for the greedy algorithm and discrete convexity
• Algebraic flows in regular matroids
• An O (n log n) algorithm for maximum st-flow in a directed planar graph
• Bisubmodular Function Minimization
• Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data
• Increasing the rooted connectivity of a digraph by one
• Linear programming duality: an introduction to oriented matroids
• Maximal Flow Through a Network
• Minimal cost flows in regular matroids
• Network flows. Theory, algorithms, and applications.
• On greedy and submodular matrices
• On structures of bisubmodular polyhedra
• Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
• Principal structures of submodular systems
• Submodular functions and optimization.
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Totally-Balanced and Greedy Matrices

Cited in

(1)

• In memoriam Walter Kern

This page was built for publication: Greedy oriented flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751094)