Association for Computing Machinery (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, 2012-05-19 - 2012-05-22, New York, United States, 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 |
| Divisions: | Management |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Date Deposited: | 11 Oct 2012 12:37 |
| Last Modified: | 13 Sep 2024 14:10 |
| URI: | http://eprints.lse.ac.uk/id/eprint/45894 |
Actions (login required)
 |
View Item |
