Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
scientific article

    Statements

    Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    26 February 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    connected vertex cover
    0 references
    chordal graphs
    0 references
    bipartite graphs
    0 references
    planar graphs
    0 references
    hypergraphs
    0 references
    approximation algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references