Computing optimal Steiner trees in polynomial space (Q2392926)

From MaRDI portal
Revision as of 15:14, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/algorithmica/FominGKLS13, #quickstatements; #temporary_batch_1731505720702)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing optimal Steiner trees in polynomial space
scientific article

    Statements

    title
    Computing optimal Steiner trees in polynomial space (English)
    0 references
    author
    Fedor V. Fomin
    0 references
    Fabrizio Grandoni
    0 references
    Dieter Kratsch
    0 references
    Daniel Lokshtanov
    0 references
    Saket Saurabh
    0 references
    published in
    Algorithmica
    0 references
    publication date
    5 August 2013
    0 references
    zbMATH Keywords
    Steiner tree
    0 references
    exact algorithms
    0 references
    space complexity
    0 references
    cites work
    Q2768314
    0 references
    Measure and conquer
    0 references
    Q4198056
    0 references
    Q4764186
    0 references
    Q3210200
    0 references
    Q5710169
    0 references
    Q5689037
    0 references
    Q4952699
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C22
    0 references
    05C35
    0 references
    05C05
    0 references
    05C85
    0 references
    90C39
    0 references
    zbMATH DE Number
    6194536
    0 references
    OpenAlex ID
    W2155235203
    0 references
    Wikidata QID
    Q60488414
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2392926&oldid=37906473"
    Powered by MediaWiki