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

Article Details
Title:	Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs
Article URLs:	https://doi.org/10.4230/LIPIcs.ICALP.2017.124
Alternative Article URLs:
Authors:	Karl Bringmann	Max Planck Institute for Informatics, Saarland Informatics Campus
	Thomas Dueholm Hansen	Aarhus University
	Sebastian Krinninger	University of Vienna
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:	https://arxiv.org/abs/1704.08122
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/icalp/BringmannHK17
Author Comments:

Intl. Colloquium on Automata, Languages, and Programming, ICALP 2017