{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:40:37Z","timestamp":1743036037834,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030053475"},{"type":"electronic","value":"9783030053482"}],"license":[{"start":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T00:00:00Z","timestamp":1546214400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-05348-2_5","type":"book-chapter","created":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T02:24:51Z","timestamp":1546223091000},"page":"49-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Simple Algorithmic Proof of the Symmetric Lopsided Lov\u00e1sz Local Lemma"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4912-8959","authenticated-orcid":false,"given":"Lefteris","family":"Kirousis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6409-4286","authenticated-orcid":false,"given":"John","family":"Livieratos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,31]]},"reference":[{"key":"5_CR1","first-page":"609","volume":"10","author":"P Erd\u0151s","year":"1975","unstructured":"Erd\u0151s, P., Lov\u00e1sz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. Infin. Finite Sets 10, 609\u2013627 (1975)","journal-title":"Infin. Finite Sets"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38536-0_1","volume-title":"Computer Science \u2013 Theory and Applications","author":"M Szegedy","year":"2013","unstructured":"Szegedy, M.: The Lov\u00e1sz local lemma \u2013 a survey. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 1\u201311. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38536-0_1"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Moser, R.A.: A constructive proof of the Lov\u00e1sz local lemma. In: Proceedings of the 41st annual ACM Symposium on Theory of Computing, pp. 343\u2013350 (2009)","DOI":"10.1145\/1536414.1536462"},{"issue":"4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1002\/rsa.3240020403","volume":"2","author":"N Alon","year":"1991","unstructured":"Alon, N.: A parallel algorithmic version of the local lemma. Random Struct. Algorithms 2(4), 367\u2013378 (1991)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/rsa.3240020402","volume":"2","author":"J Beck","year":"1991","unstructured":"Beck, J.: An algorithmic approach to the Lov\u00e1sz local lemma I. Random Struct. Algorithms 2(4), 343\u2013365 (1991)","journal-title":"Random Struct. Algorithms"},{"key":"5_CR6","unstructured":"Srivinsan, A.: Improved algorithmic versions of the Lov\u00e1sz local lemma. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 611\u2013620. Society for Industrial and Applied Mathematics (2008)"},{"key":"5_CR7","unstructured":"Tao, T.: Moser\u2019s entropy compression argument (2009). https:\/\/terrytao.wordpress.com\/2009\/08\/05\/mosers-entropy-compression-argument\/"},{"key":"5_CR8","unstructured":"Spencer, J.: Robin Moser makes Lov\u00e1sz local lemma algorithmic! (2010). https:\/\/cs.nyu.edu\/spencer\/moserlovasz1.pdf"},{"key":"5_CR9","unstructured":"Giotis, I., Kirousis, L., Psaromiligkos, K.I., Thilikos, D.M.: On the algorithmic Lov\u00e1sz local lemma and acyclic edge coloring. In: Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics. Society for Industrial and Applied Mathematics (2015). http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611973761.2"},{"issue":"2\u20133","key":"5_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0166-218X(91)90040-4","volume":"30","author":"P Erd\u0151s","year":"1991","unstructured":"Erd\u0151s, P., Spencer, J.: Lopsided Lov\u00e1sz local lemma and Latin transversals. Discret. Appl. Math. 30(2\u20133), 151\u2013154 (1991)","journal-title":"Discret. Appl. Math."},{"key":"5_CR11","unstructured":"Berman, P.R., Scott, A., Karpinski, M.: Approximation hardness and satisfiability of bounded occurrence instances of SAT. ECCC 10(022) (2003)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-03456-5_3","volume-title":"Efficient Algorithms","author":"H Gebauer","year":"2009","unstructured":"Gebauer, H., Moser, R.A., Scheder, D., Welzl, E.: The Lov\u00e1sz local lemma and satisfiability. Efficient Algorithms, pp. 30\u201354. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-642-03456-5_3"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Gebauer, H., Szab\u00f3, T., Tardos, G.: The local lemma is tight for SAT. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 664\u2013674. SIAM (2011)","DOI":"10.1137\/1.9781611973082.52"},{"key":"5_CR14","first-page":"11","volume":"57(2)","author":"RA Moser","year":"2010","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general Lov\u00e1sz local lemma. J. ACM (JACM) 57(2), 11 (2010)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1137\/16M1067767","volume":"31","author":"K Sarkar","year":"2017","unstructured":"Sarkar, K., Colbourn, C.J.: Upper bounds on the size of covering arrays. SIAM J. Discret. Math. 31(2), 1277\u20131293 (2017)","journal-title":"SIAM J. Discret. Math."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Kolipaka, K., Rao, B., Szegedy, M.: Moser and Tardos meet Lov\u00e1sz. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, pp. 235\u2013244. ACM, New York (2011)","DOI":"10.1145\/1993636.1993669"},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF02579368","volume":"5","author":"JB Shearer","year":"1985","unstructured":"Shearer, J.B.: On a problem of Spencer. Combinatorica 5(3), 241\u2013245 (1985)","journal-title":"Combinatorica"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Harvey, N.J.A., Vondr\u00e1k, J.: An algorithmic proof of the Lov\u00e1sz local lemma via resampling oracles. In: Proceedings 56th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1327\u20131346. IEEE (2015)","DOI":"10.1109\/FOCS.2015.85"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Harris, D.G.: Lopsidependency in the Moser-Tardos framework: beyond the lopsided Lov\u00e1sz local lemma. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1792\u20131808. SIAM (2015)","DOI":"10.1137\/1.9781611973730.120"},{"key":"5_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970074","volume-title":"Ten Lectures on the Probabilistic Method","author":"J Spencer","year":"1994","unstructured":"Spencer, J.: Ten Lectures on the Probabilistic Method, vol. 64. SIAM, Philadelphia (1994)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Iliopoulos, F.: Random walks that find perfect objects and the Lov\u00e1sz local lemma. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS), pp. 494\u2013503. IEEE (2014)","DOI":"10.1109\/FOCS.2014.59"},{"key":"5_CR22","volume-title":"An Introduction to the Analysis of Algorithms","author":"R Sedgewick","year":"2013","unstructured":"Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms. Addison-Wesley, Upper Saddle River (2013)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05348-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:53:43Z","timestamp":1710345223000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05348-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,31]]},"ISBN":["9783030053475","9783030053482"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05348-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,31]]},"assertion":[{"value":"31 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION 12","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalamata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/LION12\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}