A faster algorithm for the single source shortest path problem with few distinct positive lengths

James B. Orlin, Kamesh Madduri, K. Subramani, M. Williamson. A faster algorithm for the single source shortest path problem with few distinct positive lengths. J. Discrete Algorithms, 8(2):189-198, 2010. [doi]

@article{OrlinMSW10,
  title = {A faster algorithm for the single source shortest path problem with few distinct positive lengths},
  author = {James B. Orlin and Kamesh Madduri and K. Subramani and M. Williamson},
  year = {2010},
  doi = {10.1016/j.jda.2009.03.001},
  url = {http://dx.doi.org/10.1016/j.jda.2009.03.001},
  tags = {source-to-source, peer-to-peer, open-source},
  researchr = {https://researchr.org/publication/OrlinMSW10},
  cites = {0},
  citedby = {0},
  journal = {J. Discrete Algorithms},
  volume = {8},
  number = {2},
  pages = {189-198},
}