Smoothed Analysis of the Successive Shortest Path Algorithm

Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)
4 Downloads (Pure)

Search results

  • 2013

    Smoothed analysis of the successive shortest path algorithm

    Brunsch, T., Cornelissen, K., Manthey, B. & Röglin, H., 2013, Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms. Khanna, S. (ed.). New Orleans, LA, USA: SIAM, p. 1180-1189 10 p. (Proceedings ACM-SIAM Symposium on Discrete Algorithms; vol. 2013, no. 24).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    7 Citations (Scopus)
    1 Downloads (Pure)
  • Smoothed analysis of the successive shortest path algorithm

    Brunsch, T., Cornelissen, K., Hurink, J. L., Manthey, B. & Röglin, H., 2013, p. 27-30. 4 p.

    Research output: Contribution to conferencePaperpeer-review

    Open Access
    File
    251 Downloads (Pure)