A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-path vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The importance of being biased / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for feedback problems in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New primal-dual algorithms for Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for generalized Steiner network problems / rank
 
Normal rank

Revision as of 17:05, 4 July 2024

scientific article
Language Label Description Also known as
English
A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
scientific article

    Statements

    A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (English)
    0 references
    0 references
    0 references
    7 December 2011
    0 references
    combinatorial optimization
    0 references
    approximation algorithm
    0 references
    vertex cover \(P_{n}\) problem
    0 references
    primal-dual method
    0 references

    Identifiers