Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems

Nikhil Bansal, Subhash Khot. Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems. In Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis, editors, Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Volume 6198 of Lecture Notes in Computer Science, pages 250-261, Springer, 2010. [doi]

No reviews for this publication, yet.