"Min cost flow on unit capacity networks and convex cost K-flow are as easy ..."

Dorit S. Hochbaum (2016)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/Hochbaum16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/Hochbaum16
Dorit S. Hochbaum:
Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm. CoRR abs/1610.04012 (2016)

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.