Sciweavers

Share
CORR
2010
Springer
84views Education» more  CORR 2010»
9 years 9 months ago
Improved Inapproximability For Submodular Maximization
We show that it is Unique Games-hard to approximate the maximum of a submodular function to within a factor 0.695, and that it is Unique Games-hard to approximate the maximum of a ...
Per Austrin
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
10 years 4 months ago
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
Per Austrin, Subhash Khot, Muli Safra
books