On the public citation graph
New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy
0 signed · 36 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11538462_20openalex-snapshot
Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy
inferredcites →https://doi.org/10.1016/j.jcss.2007.06.019openalex-snapshot
Vertex cover might be hard to approximate to within 2−ε
inferredcites →https://doi.org/10.1109/ccc.2002.1004334openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1109/ccc.2003.1214437openalex-snapshot
Vertex cover might be hard to approximate to within 2-ε
inferredcites →https://doi.org/10.1109/sfcs.2002.1181954openalex-snapshot
Proving integrality gaps without knowing the linear program
inferredcites →https://doi.org/10.1109/sfcs.2003.1238206openalex-snapshot
Rank bounds and integrality gaps for cutting planes procedures
inferredcites →https://doi.org/10.1137/0403036openalex-snapshot
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
inferredcites →https://doi.org/10.1137/0801013openalex-snapshot
Cones of Matrices and Set-Functions and 0–1 Optimization
inferredcites →https://doi.org/10.1137/s009753970240118xopenalex-snapshot
The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set
inferredcites →https://doi.org/10.1145/1007352.1007355openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferredcites →https://doi.org/10.1145/1060590.1060634openalex-snapshot
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
inferredcites →https://doi.org/10.1145/195058.195216openalex-snapshot
.879-approximation algorithms for MAX CUT and MAX 2SAT
inferredcites →https://doi.org/10.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1287/moor.24.1.1openalex-snapshot
On a Representation of the Matching Polytope Via Semidefinite Liftings
inferredcites →https://doi.org/10.1287/moor.26.1.19.10593openalex-snapshot
On the Matrix-Cut Rank of Polyhedra
inferredcites →https://doi.org/10.1287/moor.26.4.796.10012openalex-snapshot
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
inferredcites →https://doi.org/10.4007/annals.2005.162.439openalex-snapshot
On the hardness of approximating vertex cover
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0479openalex-snapshot
Lovász‐Schrijver Reformulation
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_6openalex-snapshot
Convex Relaxations and Integrality Gaps
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_10openalex-snapshot
Optimal Sherali-Adams Gaps from Pairwise Independence
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_24openalex-snapshot
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
inferred← citeshttps://doi.org/10.1109/focs.2007.34openalex-snapshot
One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications
inferred← citeshttps://doi.org/10.1109/focs.2007.35openalex-snapshot
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy
inferred← citeshttps://doi.org/10.1109/focs.2008.74openalex-snapshot
Linear Level Lasserre Lower Bounds for Certain k-CSPs
inferred← citeshttps://doi.org/10.1109/focs.2009.73openalex-snapshot
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES
inferred← citeshttps://doi.org/10.1137/1.9781611973402.119openalex-snapshot
Hypercontractive inequalities via SOS, and the Frankl–Rödl graph
inferred← citeshttps://doi.org/10.1145/1250790.1250836openalex-snapshot
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
inferred← citeshttps://doi.org/10.1145/1536414.1536456openalex-snapshot
Sherali-adams relaxations of the matching polytope
inferred← citeshttps://doi.org/10.1145/1597036.1597045openalex-snapshot
A better approximation ratio for the vertex cover problem
inferred← citeshttps://doi.org/10.1145/2090236.2090265openalex-snapshot
Sherali-Adams relaxations and indistinguishability in counting logics
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2016.74openalex-snapshot
Approximating Directed Steiner Problems via Tree Embedding
inferred← citeshttps://doi.org/10.5555/1496770.1496810openalex-snapshot
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures
inferred← citeshttps://doi.org/10.5555/2634074.2634193openalex-snapshot
Hypercontractive inequalities via SOS, and the Frankl-Rödl graph
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.