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]

Authors

Matús Mihalák

This author has not been identified. Look up 'Matús Mihalák' in Google

Rastislav Srámek

This author has not been identified. Look up 'Rastislav Srámek' in Google

Peter Widmayer

This author has not been identified. Look up 'Peter Widmayer' in Google