pith. machine review for the scientific record. sign in

arxiv: 1210.2698 · v1 · submitted 2012-10-09 · 💻 cs.CC · cs.DM· cs.DS· math.CO· math.OC

Recognition: unknown

Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations

Authors on Pith no claims yet
classification 💻 cs.CC cs.DMcs.DSmath.COmath.OC
keywords graphscovergeneralizationspowerresultssomevertexamplifier
0
0 comments X
read the original abstract

We prove new explicit inapproximability results for the Vertex Cover Problem on the Power Law Graphs and some functional generalizations of that class of graphs. Our results depend on special bounded degree amplifier constructions for those classes of graphs and could be also of independent interest.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.