![](/img/cover-not-exists.png)
[ACM Press the 44th symposium - New York, New York, USA (2012.05.19-2012.05.22)] Proceedings of the 44th symposium on Theory of Computing - STOC '12 - Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
Végh, László A.Year:
2012
Language:
english
DOI:
10.1145/2213977.2213981
File:
PDF, 669 KB
english, 2012