A new $O(m+k n log overline{d})$ algorithm to Find the $k$ shortest paths in acyclic digraphs

@inproceedings{Kadivar2016AN,
  title={A new \$O(m+k n log overline\{d\})\$ algorithm to Find the \$k\$ shortest paths in acyclic digraphs},
  author={Mehdi Kadivar},
  year={2016}
}