Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1593162480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation guarantee for chromatic number / 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: Integrality gaps for Sherali-Adams relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal algorithms for unique games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the minimization of polynomials of fixed degree over the simplex / 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: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy / 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: Coloring -colorable graphs using relatively small palettes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate graph coloring by semidefinite programming / 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: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537750 / 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: On the complexity of Putinar's Positivstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549708 / 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: Q2934582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828974 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:27, 28 June 2024

scientific article
Language Label Description Also known as
English
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
scientific article

    Statements

    Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (English)
    0 references
    0 references
    0 references
    27 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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