The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
Year of publication: |
2004
|
---|---|
Authors: | Shioura, Akiyoshi |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 32.2004, 1, p. 31-35
|
Saved in:
Saved in favorites
Similar items by person
-
Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis
Murota, Kazuo, (2014)
-
Efficiently Scanning All Spanning Trees of an Undirected Graph
Shioura, Akiyoshi, (1995)
-
Mccormick, S.Thomas, (2000)
- More ...