We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
We study various SDP formulations for Vertex Cover by adding different constraints to the standard formulation. We rule out approximations better than
\n
\n even when we add the so-called pentagonal inequality constraints to the standard SDP formulation, and thus almost meet the
\n best upper bound known due to Karakostas, of
\n
\n . We further show the surprising fact that by strengthening the SDP with the (intractable) requirement that the metric interpretation
\n of the solution embeds into ℓ1 with no distortion, we get an exact relaxation (integrality gap is 1), and on the other hand if the solution is arbitrarily
\n close to being ℓ1 embeddable, the integrality gap is 2 − o(1). Finally, inspired by the above findings, we use ideas from the integrality gap construction of Charikar to provide a
\n family of simple examples for negative type metrics that cannot be embedded into ℓ1 with distortion better than 8/7 − ε. To this end we prove a new isoperimetric inequality for the hypercube.
\n </div
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.