Matús Mihalák, Rastislav Srámek, Peter Widmayer. Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs. Theory Comput. Syst., 58(1):45-59, 2016. [doi]
@article{MihalakSW16,
title = {Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs},
author = {Matús Mihalák and Rastislav Srámek and Peter Widmayer},
year = {2016},
doi = {10.1007/s00224-014-9571-7},
url = {http://dx.doi.org/10.1007/s00224-014-9571-7},
researchr = {https://researchr.org/publication/MihalakSW16},
cites = {0},
citedby = {0},
journal = {Theory Comput. Syst.},
volume = {58},
number = {1},
pages = {45-59},
}