Author:
Faigle Ulrich,Kern Walter,Peis Britta
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference25 articles.
1. Borradaile, G., Klein, P.: An O(n log n) algorithm for maximum st-flow in a directed planar graph. In: SODA, pp. 524–533. ACM, New York. ISBN: 0-89871-605-5 (2006)
2. Choquet G.: Theory of capacities. Ann. Inst. Fourier 5, 131–295 (1953)
3. Dietrich B.L., Hoffman A.J.: On greedy algorithms, partially ordered sets, and submodular functions. IBM J. Res. Dev. 47, 25–30 (2003)
4. Edmonds J.: Optimum branchings. J. Res. Nat. Bur. Stand. B 71, 233–240 (1967)
5. Edmonds, J.: Submodular functions, matroids and certain polyhedra. In: Proceedings of International Conference on Combinatorics (Calgary) pp. 69–87 (1970)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. In Memoriam Walter Kern;Discrete Applied Mathematics;2021-11
2. Greedy Oriented Flows;Algorithmica;2017-03-30