{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:23:02Z","timestamp":1773796982653,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030835071","type":"print"},{"value":"9783030835088","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_38","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"528-542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Independent Sets in Semi-random Hypergraphs"],"prefix":"10.1007","author":[{"given":"Yash","family":"Khanna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Louis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rameesh","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: Finding a large hidden clique in a random graph. In: Proceedings of the Eighth International Conference Random Structures and Algorithms (Poznan, 1997), vol. 13, pp. 457\u2013466 (1998)","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.4086\/toc.2011.v007a003","volume":"7","author":"P Austrin","year":"2011","unstructured":"Austrin, P., Khot, S., Safra, M.: Inapproximability of vertex cover and independent set in bounded degree graphs. Theor. Comput. 7, 27\u201343 (2011)","journal-title":"Theor. Comput."},{"key":"38_CR3","first-page":"3:1","volume-title":"34th Computational Complexity Conference (CCC 2019). Leibniz International Proceedings in Informatics (LIPIcs)","author":"A Bhangale","year":"2019","unstructured":"Bhangale, A., Khot, S.: UG-Hardness to NP-Hardness by losing half. In: Shpilka, A. (ed.) 34th Computational Complexity Conference (CCC 2019). Leibniz International Proceedings in Informatics (LIPIcs), pp. 3:1-3:20. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019)"},{"issue":"2","key":"38_CR4","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1006\/jagm.1995.1034","volume":"19","author":"A Blum","year":"1995","unstructured":"Blum, A., Spencer, J.: Coloring random and semi-random k-colorable graphs. J. Algorithms 19(2), 204\u2013234 (1995)","journal-title":"J. Algorithms"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Chlamtac, E.: Approximation algorithms using hierarchies of semidefinite programming relaxations. In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 691\u2013701 (2007)","DOI":"10.1109\/FOCS.2007.72"},{"key":"38_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-85363-3_5","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"E Chlamtac","year":"2008","unstructured":"Chlamtac, E., Singh, G.: Improved approximation guarantees through higher levels of SDP hierarchies. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX\/RANDOM -2008. LNCS, vol. 5171, pp. 49\u201362. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85363-3_5"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.laa.2020.01.039","volume":"593","author":"S Cole","year":"2020","unstructured":"Cole, S., Zhu, Y.: Exact recovery in the hypergraph stochastic block model: a spectral algorithm. Linear Algebra Appl. 593, 45\u201373 (2020)","journal-title":"Linear Algebra Appl."},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U., Krauthgamer, R.: Finding and certifying a large hidden clique in a semi-random graph. Tech. rep, ISR (1999)","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<195::AID-RSA5>3.0.CO;2-A"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J.: Heuristics for semirandom graph problems. vol. 63, pp. 639\u2013671 (2001), special issue on FOCS 98 (Palo Alto, CA)","DOI":"10.1006\/jcss.2001.1773"},{"issue":"1","key":"38_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1214\/16-AOS1453","volume":"45","author":"D Ghoshdastidar","year":"2017","unstructured":"Ghoshdastidar, D.: Consistency of spectral hypergraph partitioning under planted partition model. Ann. Statist. 45(1), 289\u2013315 (2017)","journal-title":"Ann. Statist."},{"issue":"1","key":"38_CR11","doi-asserted-by":"publisher","first-page":"16","DOI":"10.7155\/jgaa.00020","volume":"4","author":"MM Halld\u00f3rsson","year":"2000","unstructured":"Halld\u00f3rsson, M.M., Losievskaja, E.: Approximations of weighted independent set and hereditary subset problems. J. Graph Algorithms Appl. 4(1), 16 (2000)","journal-title":"J. Graph Algorithms Appl."},{"issue":"8","key":"38_CR12","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1016\/j.dam.2008.11.013","volume":"157","author":"MM Halld\u00f3rsson","year":"2009","unstructured":"Halld\u00f3rsson, M.M., Losievskaja, E.: Independent sets in bounded-degree hypergraphs. Discrete Appl. Math. 157(8), 1773\u20131786 (2009)","journal-title":"Discrete Appl. Math."},{"key":"38_CR13","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n$${}^{{1-\\epsilon }}$$. Electron. Colloquium Comput. Complex. 4(38) (1997). http:\/\/eccc.hpi-web.de\/eccc-reports\/1997\/TR97-038\/index.html"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/BFb0055806","volume-title":"Mathematical Foundations of Computer Science 1998","author":"T Hofmeister","year":"1998","unstructured":"Hofmeister, T., Lefmann, H.: Approximating maximum independent sets in uniform hypergraphs. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 562\u2013570. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055806"},{"issue":"2","key":"38_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: first steps. Soc. Networks 5(2), 109\u2013137 (1983)","journal-title":"Soc. Networks"},{"key":"38_CR16","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems, pp. 85\u2013103. Springer, US, Boston, MA (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"38_CR17","unstructured":"Khanna, Y.: Exact recovery of planted cliques in semi-random graphs. CoRR abs\/2011.08447 (2020). https:\/\/arxiv.org\/abs\/2011.08447"},{"key":"38_CR18","unstructured":"Khanna, Y., Louis, A.: Planted models for the densest k-Subgraph problem. In: Saxena, N., Simon, S. (eds.) 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 182, pp. 27:1\u201327:18. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020)"},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"Khanna, Y., Louis, A., Paul, R.: Independent sets in semi-random hypergraphs (2021)","DOI":"10.1007\/978-3-030-83508-8_38"},{"key":"38_CR20","unstructured":"Kim, C., Bandeira, A.S., Goemans, M.X.: Stochastic block model for hypergraphs: statistical limits and a semidefinite programming approach. CoRR abs\/1807.02884 (2018). http:\/\/arxiv.org\/abs\/1807.02884"},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"Klamt, S., Haus, U.U., Theis, F.: Hypergraphs and cellular networks. PLoS Comput. Biol. 5(5), e1000385 6(2009)","DOI":"10.1371\/journal.pcbi.1000385"},{"key":"38_CR22","doi-asserted-by":"crossref","unstructured":"Kolla, A., Makarychev, K., Makarychev, Y.: How to play unique games against a semi-random adversary: study of semi-random models of unique games. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (2011)","DOI":"10.1109\/FOCS.2011.78"},{"issue":"1","key":"38_CR23","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1006\/jagm.2001.1173","volume":"41","author":"M Krivelevich","year":"2001","unstructured":"Krivelevich, M., Nathaniel, R., Sudakov, B.: Approximating coloring and maximum independent sets in 3-uniform hypergraphs. J. Algorithms 41(1), 99\u2013113 (2001)","journal-title":"J. Algorithms"},{"issue":"3","key":"38_CR24","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2000","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2000)","journal-title":"SIAM J. Optim."},{"key":"38_CR25","unstructured":"Louis, A., Venkat, R.: Semi-random graphs with planted sparse vertex cuts: algorithms for exact and approximate recovery. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9\u201313 2018, Prague, Czech Republic. LIPIcs, vol. 107, pp. 101:1\u2013101:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"38_CR26","unstructured":"Louis, A., Venkat, R.: Planted models for $$k$$-way edge and vertex expansion. In: 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs. Leibniz Int. Proc. Inform., vol. 150, pp. Art. No. 23, 15. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2019)"},{"key":"38_CR27","doi-asserted-by":"crossref","unstructured":"Makarychev, K., Makarychev, Y., Vijayaraghavan, A.: Approximation algorithms for semi-random partitioning problems. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, p. 367\u2013384. STOC 2012, Association for Computing Machinery, New York, NY, USA (2012)","DOI":"10.1145\/2213977.2214013"},{"key":"38_CR28","doi-asserted-by":"crossref","unstructured":"Makarychev, K., Makarychev, Y., Vijayaraghavan, A.: Constant factor approximation for balanced cut in the PIE model. In: STOC 2014\u2013Proceedings of the 2014 ACM Symposium on Theory of Computing, pp. 41\u201349. ACM, New York (2014)","DOI":"10.1145\/2591796.2591841"},{"key":"38_CR29","unstructured":"Matula, D.: The largest clique in a random graph. Tech. rep., Department of Computer Science, Southern Methodist University (1976). https:\/\/s2.smu.edu\/~matula\/Tech-Report76.pdf"},{"key":"38_CR30","doi-asserted-by":"crossref","unstructured":"McKenzie, T., Mehta, H., Trevisan, L.: A new algorithm for the robust semi-random independent set problem. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, p. 738\u2013746 (2020)","DOI":"10.1137\/1.9781611975994.45"},{"key":"38_CR31","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Squared functional systems and optimization problems. In: High performance optimization, Appl. Optim., vol. 33, pp. 405\u2013440. Kluwer Acad. Publ., Dordrecht (2000)","DOI":"10.1007\/978-1-4757-3216-0_17"},{"issue":"2","key":"38_CR32","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"PA Parrilo","year":"2003","unstructured":"Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2), 293\u2013320 (2003)","journal-title":"Math. Program."},{"key":"38_CR33","unstructured":"Rothvo\u00df, T.: The lasserre hierarchy in approximation algorithms - Lecture Notes for the MAPSP Tutorial (2013). https:\/\/sites.math.washington.edu\/~rothvoss\/lecturenotes\/lasserresurvey.pdf"},{"key":"38_CR34","doi-asserted-by":"crossref","unstructured":"Shor, N.: An approach to obtaining global extremums in polynomial mathematical programming problems. kibernetika, vol. 5, pp. 102\u2013106 (1998). Nondifferentiable Optimization and Polynomial Problems (1987)","DOI":"10.1007\/BF01074929"},{"key":"38_CR35","first-page":"69","volume":"24","author":"J Steinhardt","year":"2017","unstructured":"Steinhardt, J.: Does robustness imply tractability? a lower bound for planted clique in the semi-random model. Electron. Colloquium Comput. Complex. 24, 69 (2017)","journal-title":"Electron. Colloquium Comput. Complex."},{"key":"38_CR36","doi-asserted-by":"crossref","unstructured":"Yan, G.: Finding common ground among experts\u2019 opinions on data clustering: with applications in malware analysis. In: 2014 IEEE 30th International Conference on Data Engineering, pp. 15\u201327 (2014)","DOI":"10.1109\/ICDE.2014.6816636"},{"key":"38_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-60469-5","volume-title":"Hypergraph theory in wireless communication networks","author":"H Zhang","year":"2018","unstructured":"Zhang, H., Song, L., Han, Z., Zhang, Y.: Hypergraph theory in wireless communication networks. SpringerBriefs in Electrical and Computer Engineering, Springer, Cham (2018)"},{"issue":"6","key":"38_CR38","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theor. Comput. 3(6), 103\u2013128 (2007)","journal-title":"Theor. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:29:04Z","timestamp":1645183744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"123","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}