Cookies?
Library Header Image
LSE Research Online LSE Library Services

Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives

Végh, László A. (2012) Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. In: STOC 2012 - 44th ACM Symposium on Theory of Computing, 19th-22nd May 2012, New York, USA.

Full text not available from this repository.

Item Type: Conference or Workshop Item (Paper)
Official URL: http://cs.nyu.edu/~stoc2012/default.htm
Additional Information: © 2012 ACM
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Sets: Departments > Management
Date Deposited: 11 Oct 2012 12:37
Last Modified: 04 May 2017 13:59
URI: http://eprints.lse.ac.uk/id/eprint/45894

Actions (login required)

View Item View Item