Author:
Goldberg Andrew V.,Grigoriadis Michael D.,Tarjan Robert E.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference21 articles.
1. R.K. Ahuja and J.B. Orlin, “A fast and simple algorithm for the maximum flow problem,”Operations Research 37 (1989) 748–759.
2. R.K. Ahuja, J.B. Orlin and R.E. Tarjan, “Improved time bounds for the maximum flow problem,”SIAM Journal on Computing 18 (1989) 939–954.
3. V. Chvatal,Linear Programming (Freeman, New York, 1983).
4. W.H. Cunningham, “A network simplex method,”Mathematical Programming 1 (1976) 105–116.
5. G.L. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963).
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. A Friendly Smoothed Analysis of the Simplex Method;SIAM Journal on Computing;2020-01
3. A friendly smoothed analysis of the simplex method;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20
4. Gate Sizing;Encyclopedia of Algorithms;2016
5. Dynamic Trees;Encyclopedia of Algorithms;2016