Inapproximability of hypergraph vertex cover and applications to scheduling problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 250-261

  Bansal, Nikhil ^a   Khot, Subhash ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSEMBLY LINE; HYPERGRAPH; HYPERGRAPH VERTEX COVER; INAPPROXIMABILITY; K-PARTITE; MAKESPAN; OPEN SHOP; OPTIMAL INAPPROXIMABILITY; SCHEDULING PROBLEM; TOTAL WEIGHTED COMPLETION TIME; UNIQUE GAMES CONJECTURE; VERTEX COVER PROBLEMS;

GRAPH THEORY; HARDNESS; LINGUISTICS; SCHEDULING; SCHEDULING ALGORITHMS; TRANSLATION (LANGUAGES);

OPTIMIZATION;

EID: 77955327992     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_22     Document Type: Conference Paper

References (22)

1. Bansal, N., Khot, S.: An optimal long code test with one free bit. In: FOCS (2009)
2. Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs, and nonapproximability- towards tight results. SIAM Journal on Computing 27 (3), 804-915 (1998)
3. Dinur, I., Guruswami, V., Khot, S.: Vertex cover on k-uniform hypergraphs is hard to approximate within factor (κ - 3 - ε). In: Electronic Colloquium on Computational Complexity, Technical Report TR02-027 (2002)
4. Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. SIAM Journal on Computing 34 (5), 1129-1146 (2005)
5. Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162 (1) (2005) (Preliminary version in STOC 2002)
6. Feige, U., Goldwasser, S., Lovász, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. Journal of the ACM 43 (2), 268-292 (1996)
7. Garg, N., Kumar, A., Pandit, V.: Order scheduling models: Hardness and algorithms. In: FSTTCS, pp. 96-107 (2007)
8. Goldreich, O.: Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs. ECCC Technical Report TR01-102 (2001)
9. Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM Journal on Computing 31 (5), 1608-1623 (2002)
10. Håstad, J.: Some optimal inapproximability results. Journal of ACM 48 (4), 798-859 (2001)
11. Holmerin, J.: Improved inapproximability results for vertex cover on k-regular hyper-graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 1005-1016. Springer, Heidelberg (2002)
12. Holmerin, J.: Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε. In: Proc. 34th ACM Symp. on Theory of Computing (STOC), pp. 544-552 (2002)
13. Karakostas, G.: A better approximation ratio for the vertex cover problem. In: Caires, L., Italiano, G. F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1043-1050. Springer, Heidelberg (2005)
14. Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. 34th ACM Symposium on Theory of Computing (2002)
15. Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci. 74 (3), 335-349 (2008)
16. Leung, J., Li, H., Pinedo, M.: Order scheduling models: an overview. In: Multidisciplinary Scheduling: Theory and Applications, pp. 37-56 (2003)
17. Leung, J. Y. T., Li, H., Pinedo, M.: Scheduling orders for multiple product types to minimize total weighted completion time. Discrete Appl. Math. 155, 945-970 (2007)
18. Mastrolilli, M., Queyranne, M., Schulz, A. S., Svensson, O., Uhan, N. A.: Minimizing the sum of weighted completion times in a concurrent open shop. Preprint (2009)
19. Mossel, E.: Gaussian bounds for noise correlation of functions. To Appear in GAFA. Current version on arxiv/math/0703683 (2009)
20. Potts, C. N., Sevastianov, S. V., Strusevish, V. A., Van Wassenhove, L. N., Zwaneveld, C. M.: The two-stage assembly scheduling problem: Complexity and approximation. Operations Research 43, 346-355 (1995)
21. Schuurman, P., Woeginger, G. J.: Polynomial time approximation algorithms for machine scheduling: ten open problems. Journal of Scheduling 2, 203-213 (1999)
22. Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proc. 33rd ACM Symp. on Theory of Computing (STOC), pp. 453-461 (2001)