A probabilistic PTAS for shortest common superstring (Q393897)

From MaRDI portal
Revision as of 03:21, 30 January 2024 by Import240129110155 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A probabilistic PTAS for shortest common superstring
scientific article

    Statements

    title
    A probabilistic PTAS for shortest common superstring (English)
    0 references
    author
    Kai Plociennik
    0 references
    publication date
    24 January 2014
    0 references
    zbMATH Keywords
    shortest common superstring
    0 references
    approximation
    0 references
    average-case analysis
    0 references
    semi-random input
    0 references
    greedy superstring
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W25
    0 references
    68Q17
    0 references
    68Q32
    0 references
    68W20
    0 references
    zbMATH DE Number
    6249999
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q393897&oldid=12266945"
    Powered by MediaWiki