Counting approximately-shortest paths in directed acyclic graphs

Matúš Mihalák*, Rastislav Šrámek, Peter Widmayer

*Corresponding author for this work

Research output: Working paper / Preprint › Preprint

  • 1 Conference article in proceeding
Filter
Conference article in proceeding

Search results

  • 2013

    Counting Approximately-Shortest Paths in Directed Acyclic Graphs

    Mihalák, M., Šrámek, R. & Widmayer, P., 2013, Proc. 11th International Workshop on Approximation and Online Algorithms (WAOA). Springer Verlag, p. 156-167 12 p. (Lecture Notes in Computer Science, Vol. 8447).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review