English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem

MPS-Authors
/persons/resource/persons118120

Becker,  Ruben
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons79263

Fickert,  Maximilian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44737

Karrenbauer,  Andreas       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Becker, R., Fickert, M., & Karrenbauer, A. (2016). A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. In M. Goodrich, & M. Mitzenmacher (Eds.), Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (pp. 151-159). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974317.13.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0029-4AD0-6
Abstract
There is no abstract available