Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs (Q5252687)

From MaRDI portal
Revision as of 04:46, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6442171
Language Label Description Also known as
English
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
scientific article; zbMATH DE number 6442171

    Statements

    title
    Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs (English)
    0 references
    DOI
    10.1137/070705970
    0 references
    publication date
    2 June 2015
    0 references
    Mathematics Subject Classification ID
    05C21
    0 references
    05C40
    0 references
    05C80
    0 references
    05C35
    0 references
    05C30
    0 references
    68W25
    0 references
    68W40
    0 references
    68Q25
    0 references
    05C85
    0 references
    zbMATH DE Number
    6442171
    0 references
    zbMATH Keywords
    minimum cut
    0 references
    maximum flow random graph
    0 references
    random sampling
    0 references
    connectivity
    0 references
    cut enumeration
    0 references
    network reliability
    0 references
    author
    András A. Benczúr
    0 references
    David R. Karger
    0 references
    OpenAlex ID
    W1543491698
    0 references
    arXiv ID
    cs/0207078
    0 references
    cites work
    Q3056948
    0 references
    Q3660628
    0 references
    Q4228453
    0 references
    Q3619797
    0 references
    On clusterings
    0 references
    Q3140397
    0 references
    Q4250217
    0 references
    Q4086956
    0 references
    Q3140458
    0 references
    Q3707420
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5252687&oldid=35457962"
    Powered by MediaWiki