Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3002764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander flows, geometric embeddings and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality gaps for Sherali-Adams relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover / 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: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proofs and the hardness of approximating cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / 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: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934582 / rank
 
Normal rank

Latest revision as of 10:20, 5 July 2024

scientific article
Language Label Description Also known as
English
Towards strong nonapproximability results in the Lovász-Schrijver hierarchy
scientific article

    Statements

    Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    NP-complete problems
    0 references
    approximation algorithm
    0 references
    proof complexity
    0 references
    lift and project methods
    0 references
    matrix cut operators
    0 references
    lower bounds
    0 references
    random instances of 3SAT
    0 references
    0 references