"Strongly polynomial algorithm for a class of minimum-cost flow problems ..."

László A. Végh (2012)

> Home

Details and statistics

DOI: 10.1145/2213977.2213981

access: closed

type: Conference or Workshop Paper

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/Vegh12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/Vegh12
László A. Végh:
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. STOC 2012: 27-40

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.