Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943)

From MaRDI portal
Revision as of 07:31, 29 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover
scientific article

    Statements

    Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (English)
    0 references
    0 references
    0 references
    0 references
    7 April 2016
    0 references
    connected \(k\)-path vertex cover
    0 references
    weight
    0 references
    girth
    0 references
    approximation algorithm
    0 references

    Identifiers

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