A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353)

From MaRDI portal
Revision as of 22:19, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/siamcomp/BodlaenderDDFLP16, #quickstatements; #temporary_batch_1731530891435)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A $c^k n$ 5-Approximation Algorithm for Treewidth
scientific article

    Statements

    title
    A $c^k n$ 5-Approximation Algorithm for Treewidth (English)
    0 references
    author
    Pål Grønås Drange
    0 references
    Markus Sortland Dregi
    0 references
    Fedor V. Fomin
    0 references
    Daniel Lokshtanov
    0 references
    Michał Pilipczuk
    0 references
    Hans L. Bodlaender
    0 references
    publication date
    11 April 2016
    0 references
    zbMATH Keywords
    algorithms
    0 references
    graphs
    0 references
    treewidth
    0 references
    approximation
    0 references
    fixed parameter tractability
    0 references
    cites work
    Q4273870
    0 references
    Q3795218
    0 references
    Q4234136
    0 references
    Q3328583
    0 references
    Q4344138
    0 references

    Identifiers

    DOI
    10.1137/130947374
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    05C05
    0 references
    68R10
    0 references
    68W25
    0 references
    zbMATH DE Number
    6566956
    0 references
    Wikidata QID
    Q59567401
    0 references
    OpenAlex ID
    W2313886575
    0 references
    arXiv ID
    1304.6321
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2799353&oldid=37910449"
    Powered by MediaWiki