Complexity and approximation of the constrained forest problem (Q553340)

From MaRDI portal
Revision as of 15:33, 11 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q237413)
scientific article
Language Label Description Also known as
English
Complexity and approximation of the constrained forest problem
scientific article

    Statements

    title
    Complexity and approximation of the constrained forest problem (English)
    0 references
    author
    Cristina Bazgan
    0 references
    Basile Couëtoux
    0 references
    Zsolt Tuza
    0 references
    publication date
    27 July 2011
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q17
    0 references
    05C85
    0 references
    zbMATH DE Number
    5932524
    0 references
    zbMATH Keywords
    complexity
    0 references
    approximation
    0 references
    APX-hardness
    0 references
    constrained forest
    0 references
    ptas
    0 references
    bipartite graphs
    0 references
    planar graphs
    0 references
    treewidth
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q553340&oldid=20645635"
    Powered by MediaWiki