Abstract
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of minimizing the total weighted completion time in concurrent open shops. We also obtain a hardness of 2 − ε for minimizing the makespan in the assembly line problem.
These results follow from a new inapproximability result for the Vertex Cover problem on k-uniform hypergraphs that is stronger and simpler than previous results. We show that assuming the UGC, for every k ≥ 2, the problem is inapproximable within k − ε even when the hypergraph is almost k -partite.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bansal, N., Khot, S.: An optimal long code test with one free bit. In: FOCS (2009)
Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs, and nonapproximability—towards tight results. SIAM Journal on Computing 27(3), 804–915 (1998)
Dinur, I., Guruswami, V., Khot, S.: Vertex cover on k-uniform hypergraphs is hard to approximate within factor (k − 3 − ε). In: Electronic Colloquium on Computational Complexity, Technical Report TR02-027 (2002)
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)
Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162(1) (2005) (Preliminary version in STOC 2002)
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)
Garg, N., Kumar, A., Pandit, V.: Order scheduling models: Hardness and algorithms. In: FSTTCS, pp. 96–107 (2007)
Goldreich, O.: Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs. ECCC Technical Report TR01-102 (2001)
Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM Journal on Computing 31(5), 1608–1623 (2002)
Håstad, J.: Some optimal inapproximability results. Journal of ACM 48(4), 798–859 (2001)
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)
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)
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)
Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. 34th ACM Symposium on Theory of Computing (2002)
Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci. 74(3), 335–349 (2008)
Leung, J., Li, H., Pinedo, M.: Order scheduling models: an overview. In: Multidisciplinary Scheduling: Theory and Applications, pp. 37–56 (2003)
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)
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)
Mossel, E.: Gaussian bounds for noise correlation of functions. To Appear in GAFA. Current version on arxiv/math/0703683 (2009)
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)
Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: ten open problems. Journal of Scheduling 2, 203–213 (1999)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bansal, N., Khot, S. (2010). Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-14165-2_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14164-5
Online ISBN: 978-3-642-14165-2
eBook Packages: Computer ScienceComputer Science (R0)