On the public citation graph

Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy

https://doi.org/10.1137/080721479
0 signed · 41 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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.1016/s0025-5610(97)00028-2openalex-snapshot
inferredcites →https://doi.org/10.1090/s0002-9947-1987-0871675-6openalex-snapshot
Forbidden Intersections
inferredcites →https://doi.org/10.1090/s0273-0979-1993-00398-7openalex-snapshot
A counterexample to Borsuk’s conjecture
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
inferredcites →https://doi.org/10.1137/0801013openalex-snapshot
Cones of Matrices and Set-Functions and 0–1 Optimization
inferredcites →https://doi.org/10.1137/s0097539700381097openalex-snapshot
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
inferredcites →https://doi.org/10.1137/s0895480195287541openalex-snapshot
The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
inferredcites →https://doi.org/10.1145/1502793.1502794openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferredcites →https://doi.org/10.1145/1597036.1597045openalex-snapshot
A better approximation ratio for the vertex cover problem
inferredcites →https://doi.org/10.1145/226643.226652openalex-snapshot
Interactive proofs and the hardness of approximating cliques
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.4007/annals.2005.162.439openalex-snapshot
On the hardness of approximating vertex cover
inferredcites →https://doi.org/10.4086/toc.2006.v002a002openalex-snapshot
inferredcites →https://doi.org/10.4086/toc.2006.v002a004openalex-snapshot

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_13openalex-snapshot
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines
inferred← citeshttps://doi.org/10.1007/s00037-011-0027-zopenalex-snapshot
Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy
inferred← citeshttps://doi.org/10.1007/s10107-017-1152-5openalex-snapshot
Semidefinite and linear programming integrality gaps for scheduling identical machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.03.004openalex-snapshot
Lift & project systems performing on the partial-vertex-cover polytope
inferred← citeshttps://doi.org/10.1109/ccc.2012.43openalex-snapshot
Reductions between Expansion Problems
inferred← citeshttps://doi.org/10.1109/focs.2009.73openalex-snapshot
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00069openalex-snapshot
Explicit Lower Bounds Against Ω(n)-Rounds of Sum-of-Squares
inferred← citeshttps://doi.org/10.1137/100816833openalex-snapshot
Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász–Schrijver Procedures
inferred← citeshttps://doi.org/10.1137/130950173openalex-snapshot
A Comprehensive Analysis of Polyhedral Lift-and-Project Methods
inferred← citeshttps://doi.org/10.1137/15m1046575openalex-snapshot
Hypercontractivity of Spherical Averages in Hamming Space
inferred← citeshttps://doi.org/10.1137/16m1079245openalex-snapshot
The Power of Sherali--Adams Relaxations for General-Valued CSPs
inferred← citeshttps://doi.org/10.1137/16m1082007openalex-snapshot
Communication Lower Bounds via Critical Block Sensitivity
inferred← citeshttps://doi.org/10.1137/20m1359584openalex-snapshot
Superlinear Integrality Gaps for the Minimum Majority Problem
inferred← citeshttps://doi.org/10.1145/1978782.1978784openalex-snapshot
How well can primal-dual and local-ratio algorithms perform?
inferred← citeshttps://doi.org/10.1145/2213977.2213988openalex-snapshot
Linear vs. semidefinite extended formulations
inferred← citeshttps://doi.org/10.1145/2591796.2591838openalex-snapshot
Communication lower bounds via critical block sensitivity
inferred← citeshttps://doi.org/10.1145/2716307openalex-snapshot
Exponential Lower Bounds for Polytopes in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1287/moor.2017.0918openalex-snapshot
No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ
inferred← citeshttps://doi.org/10.4086/toc.2012.v008a012openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2014.199openalex-snapshot
Lift & Project Systems Performing on the Partial Vertex Cover Polytope
inferred← citeshttps://doi.org/10.48550/arxiv.1111.0837openalex-snapshot
Exponential Lower Bounds for Polytopes in Combinatorial Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1204.5489openalex-snapshot
Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods
inferred← citeshttps://doi.org/10.48550/arxiv.1305.5998openalex-snapshot
Integrality gaps for strengthened LP relaxations of Capacitated and Lower-Bounded Facility Location
inferred← citeshttps://doi.org/10.5555/2095116.2095150openalex-snapshot
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
inferred← citeshttps://doi.org/10.5555/2634074.2634193openalex-snapshot
Hypercontractive inequalities via SOS, and the Frankl-Rödl graph
inferred← citeshttps://doi.org/10.70675/7c077eefz7a43z411bz9443zd07cf97770b4openalex-snapshot
Convex and online optimization : applications to scheduling and selection problems
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.