Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs. Mihalák, M., Srámek, R., & Widmayer, P. Theory Comput. Syst., 58(1):45–59, 2016.
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs [link]Paper  doi  bibtex   
@ARTICLE{MihalakSW2016J,
  author = {Mat{\'{u}}s Mihal{\'{a}}k and Rastislav Sr{\'{a}}mek and Peter Widmayer},
  title = {{A}pproximately {C}ounting {A}pproximately-{S}hortest {P}aths in
	{D}irected {A}cyclic {G}raphs},
  journal = {Theory Comput. Syst.},
  year = {2016},
  volume = {58},
  pages = {45--59},
  number = {1},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  biburl = {http://dblp.uni-trier.de/rec/bib/journals/mst/MihalakSW16},
  doi = {10.1007/s00224-014-9571-7},
  timestamp = {Thu, 07 Jan 2016 14:55:35 +0100},
  url = {http://dx.doi.org/10.1007/s00224-014-9571-7}
}
Downloads: 0