Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs

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]

Possibly Related Publications

The following publications are possibly variants of this publication: