de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44182

Bringmann,  Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Bringmann, K., Dueholm Hansen, T., & Krinninger, S. (2017). Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. In I. Chatzigiannakis, P. Indyk, F. Kuhn, & A. Muscholl (Eds.), 44th International Colloquium on Automata, Languages, and Programming (pp. 1-16). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2017.124.


Cite as: http://hdl.handle.net/11858/00-001M-0000-002D-89C4-F
Abstract
There is no abstract available