English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs

Bringmann, K., Dueholm Hansen, T., & Krinninger, S. (in press). Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. In 44th International Colloquium on Automata, Languages, and Programming. Wadern: Schloss Dagstuhl.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-002D-89C4-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002D-89C5-D
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bringmann, Karl1, Author           
Dueholm Hansen, Thomas2, Author
Krinninger, Sebastian2, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2017
 Publication Status: Accepted / In Press
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: BringmannICALP2017
 Degree: -

Event

show
hide
Title: 44th International Colloquium on Automata, Languages, and Programming
Place of Event: Warsaw, Poland
Start-/End Date: 2017-07-10 - 2017-07-14

Legal Case

show

Project information

show

Source 1

show
hide
Title: 44th International Colloquium on Automata, Languages, and Programming
  Abbreviation : ICALP 2017
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Wadern : Schloss Dagstuhl
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -

Source 2

show
hide
Title: Leibniz International Proceedings in Informatics
  Abbreviation : LIPIcs
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -