Complexity and approximation of the constrained forest problem (Q553340): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Cristina Bazgan / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5932524 / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation
Property / zbMATH Keywords: approximation / rank
 
Normal rank
Property / zbMATH Keywords
 
APX-hardness
Property / zbMATH Keywords: APX-hardness / rank
 
Normal rank
Property / zbMATH Keywords
 
constrained forest
Property / zbMATH Keywords: constrained forest / rank
 
Normal rank
Property / zbMATH Keywords
 
ptas
Property / zbMATH Keywords: ptas / rank
 
Normal rank
Property / zbMATH Keywords
 
bipartite graphs
Property / zbMATH Keywords: bipartite graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
planar graphs
Property / zbMATH Keywords: planar graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
treewidth
Property / zbMATH Keywords: treewidth / rank
 
Normal rank

Revision as of 14:09, 1 July 2023

scientific article
Language Label Description Also known as
English
Complexity and approximation of the constrained forest problem
scientific article

    Statements

    Complexity and approximation of the constrained forest problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    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