Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.10.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038655901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover Approximations on Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An edge-reduction algorithm for the vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better approximation ratio for the vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey numbers and an approximation algorithm for the vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank

Latest revision as of 00:50, 5 July 2024

scientific article
Language Label Description Also known as
English
Strong and weak edges of a graph and linkages with the vertex cover problem
scientific article

    Statements

    Strong and weak edges of a graph and linkages with the vertex cover problem (English)
    0 references
    0 references
    0 references
    19 March 2012
    0 references
    vertex cover problem
    0 references
    approximation algorithm
    0 references
    LP-relaxation
    0 references
    weak edge reduction
    0 references
    NP-complete problems
    0 references

    Identifiers

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