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

Becker, Ruben; Fickert, Maximilian; Karrenbauer, Andreas

doi:10.1137/1.9781611974317.13

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

このアイテムの新しいバージョンが利用可能です:
https://pure.mpg.de/pubman/item/item_2241033_3

詳細要約

公開

会議論文

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

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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.

引用: https://hdl.handle.net/11858/00-001M-0000-0029-4AD0-6

要旨

要旨はありません