Smoothed Analysis of the Successive Shortest Path Algorithm (Q3457194)

From MaRDI portal
Revision as of 04:24, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Smoothed Analysis of the Successive Shortest Path Algorithm
scientific article

    Statements

    title
    Smoothed Analysis of the Successive Shortest Path Algorithm (English)
    0 references
    author
    Tobias Brunsch
    0 references
    Kamiel Cornelissen
    0 references
    Bodo Manthey
    0 references
    Heiko Röglin
    0 references
    Clemens Rösner
    0 references
    publication date
    11 December 2015
    0 references
    zbMATH Keywords
    minimum-cost flows
    0 references
    successive shortest path algorithm
    0 references
    smoothed analysis
    0 references
    cites work
    Q3056948
    0 references
    Q3651735
    0 references
    Q3292914
    0 references
    Monotone networks
    0 references

    Identifiers

    DOI
    10.1137/140989893
    0 references
    Mathematics Subject Classification ID
    05C12
    0 references
    05C85
    0 references
    05C35
    0 references
    05C38
    0 references
    90C27
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6519539
    0 references
    OpenAlex ID
    W2480513428
    0 references
    arXiv ID
    1501.05493
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3457194&oldid=36217981"
    Powered by MediaWiki