Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827)

From MaRDI portal
Revision as of 01:17, 29 June 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
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
scientific article

    Statements

    Degree-Constrained Subgraph Problems: Hardness and Approximation Results (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 February 2009
    0 references
    approximation algorithms
    0 references
    degree-constrained subgraphs
    0 references
    hardness of approximation
    0 references
    APX
    0 references
    PTAS
    0 references
    excluded minor
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references