Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
Association for Computing Machinery
(2012-05-19 - 2012-05-22)
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
[Paper]. STOC 2012 - 44th ACM Symposium on Theory of Computing, New York, United States, USA.
| Item Type | Conference or Workshop Item (Paper) |
|---|---|
| Copyright holders | © 2012 ACM |
| Departments | LSE > Academic Departments > Management |
| Date Deposited | 11 Oct 2012 |
| URI | https://researchonline.lse.ac.uk/id/eprint/45894 |
Explore Further
- http://www.lse.ac.uk/Mathematics/people/Laszlo-Vegh.aspx (Author)
- http://dx.doi.org/10.1145/2213977.2213981 (Publisher)
- https://www.scopus.com/pages/publications/84862601202 (Scopus publication)
- http://cs.nyu.edu/~stoc2012/default.htm (Official URL)