On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs-Reference-Cited by-同舟云学术

On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs

Published:2010 Issue: Volume: Page:360-371
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Guruswami Venkatesan,Saket Rishi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-14165-2_31

Reference21 articles.

1. Aharoni, R., Holzman, R., Krivelevich, M.: On a theorem of Lovász on covers in r-partite hypergraphs. Combinatorica 16(2), 149–174 (1996)

2. Austrin, P., Mossel, E.: Approximation resistant predicates from pairwise independence. In: IEEE Conference on Computational Complexity, pp. 249–258 (2008)

3. Bansal, N., Khot, S.: Inapproximability of hypergraph vertex cover and applications to scheduling problems. In: Proceedings of ICALP (July 2009)

4. Dinur, I., Guruswami, V., Khot, S.: Vertex cover on k-uniform hypergraphs is hard to approximate within factor (k-3-ε). ECCC Technical Report TR02-027 (2002)

5. Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. In: Proc. 35 th ACM STOC, pp. 595–601 (2003)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximation algorithms for orthogonal line centers;Discrete Applied Mathematics;2023-10

2. Hypergraph Representation via Axis-Aligned Point-Subspace Cover;WALCOM: Algorithms and Computation;2022

3. Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs;Journal of Discrete Algorithms;2015-07

4. Hardness of Graph Pricing Through Generalized Max-Dicut;Proceedings of the forty-seventh annual ACM symposium on Theory of Computing;2015-06-14

5. Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs;SIAM Journal on Discrete Mathematics;2015-01