Approximation algorithms via contraction decomposition (Q1945289)

From MaRDI portal
Revision as of 08:49, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximation algorithms via contraction decomposition
scientific article

    Statements

    Approximation algorithms via contraction decomposition (English)
    0 references
    0 references
    0 references
    5 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    graphs of bounded (Euler) genus
    0 references
    contracting edges
    0 references
    graphs of bounded treewidth
    0 references
    obtaining PTASs for contraction-closed problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references