Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 26 Apr 2017 in cs.DS | (1704.08122v1)

Abstract: We study the problem of finding the cycle of minimum cost-to-time ratio in a directed graph with n n nodes and m m edges. This problem has a long history in combinatorial optimization and has recently seen interesting applications in the context of quantitative verification. We focus on strongly polynomial algorithms to cover the use-case where the weights are relatively large compared to the size of the graph. Our main result is an algorithm with running time O~(m3/4n3/2) \tilde O (m^{3/4} n^{3/2}) , which gives the first improvement over Megiddo's O~(n3) \tilde O (n^3) algorithm [JACM'83] for sparse graphs. We further demonstrate how to obtain both an algorithm with running time n3/2Ω(log⁡n) n^3 / 2^{\Omega{(\sqrt{\log n})}} on general graphs and an algorithm with running time O~(n) \tilde O (n) on constant treewidth graphs. To obtain our main result, we develop a parallel algorithm for negative cycle detection and single-source shortest paths that might be of independent interest.

Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.