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

Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger. Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. In Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anca Muscholl, editors, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland. Volume 80 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

@inproceedings{BringmannHK17,
  title = {Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs},
  author = {Karl Bringmann and Thomas Dueholm Hansen and Sebastian Krinninger},
  year = {2017},
  doi = {10.4230/LIPIcs.ICALP.2017.124},
  url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.124},
  researchr = {https://researchr.org/publication/BringmannHK17},
  cites = {0},
  citedby = {0},
  booktitle = {44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland},
  editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
  volume = {80},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-041-5},
}