Speeding Up Dynamic Programming with Representative Sets (Q2867093)

From MaRDI portal
Revision as of 00:51, 24 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59567519, #quickstatements; #temporary_batch_1711234560214)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Speeding Up Dynamic Programming with Representative Sets
scientific article

    Statements

    title
    Speeding Up Dynamic Programming with Representative Sets (English)
    0 references
    author
    Stefan Fafianie
    0 references
    Jesper Nederlof
    0 references
    Hans L. Bodlaender
    0 references
    publication date
    10 December 2013
    0 references
    zbMATH Keywords
    experimental evaluation
    0 references
    algorithmic engineering
    0 references
    Steiner tree
    0 references
    treewidth
    0 references
    dynamic programming
    0 references
    exact algorithms
    0 references
    describes a project that uses
    Treewidthlib
    0 references
    GeoSteiner
    0 references
    SteinLib
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W05
    0 references
    05C85
    0 references
    90C39
    0 references
    zbMATH DE Number
    6237078
    0 references
    OpenAlex ID
    W2139888361
    0 references
    Wikidata QID
    Q59567519
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2867093&oldid=33194434"
    Powered by MediaWiki