A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability (Q5232317)

From MaRDI portal
Revision as of 07:52, 14 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127887379, #quickstatements; #temporary_batch_1723616886801)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7100371
Language Label Description Also known as
English
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
scientific article; zbMATH DE number 7100371

    Statements

    title
    A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability (English)
    0 references
    author
    Heng Guo
    0 references
    Mark R. Jerrum
    0 references
    publication date
    2 September 2019
    0 references
    zbMATH Keywords
    network reliability
    0 references
    approximate counting
    0 references
    randomized algorithms
    0 references
    cites work
    Q5002746
    0 references
    Q3135082
    0 references
    Q3140234
    0 references
    Q4704790
    0 references
    Q4228482
    0 references

    Identifiers

    DOI
    10.1137/18M1201846
    0 references
    Mathematics Subject Classification ID
    68W20
    0 references
    68R10
    0 references
    68W25
    0 references
    68W40
    0 references
    zbMATH DE Number
    7100371
    0 references
    arXiv ID
    1709.08561
    0 references
    OpenAlex ID
    W2949441583
    0 references
    Wikidata QID
    Q127887379
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5232317&oldid=37587084"
    Powered by MediaWiki