English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0029-4AD0-6 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-838A-7
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Becker, Ruben1, Author           
Fickert, Maximilian1, Author           
Karrenbauer, Andreas1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2016
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: BeckerALENEX2016
DOI: 10.1137/1.9781611974317.13
 Degree: -

Event

show
hide
Title: Eighteenth Workshop on Algorithm Engineering and Experiments
Place of Event: Arlington, VA, USA
Start-/End Date: 2016-01-10 - 2016-01-10

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments
  Abbreviation : ALENEX 2016
  Subtitle : ALENEX16 ; Meeting on Algorithm Engineering & Experiments ; January 10, 2016, Crystal Gateway Marriott, Arlington, Virginia, USA
Source Genre: Proceedings
 Creator(s):
Goodrich, Michael1, Editor
Mitzenmacher, Michael1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 151 - 159 Identifier: ISBN: 978-1-61197-431-7