{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:10:42Z","timestamp":1743016242577,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031498145"},{"type":"electronic","value":"9783031498152"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49815-2_15","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:02:28Z","timestamp":1703142148000},"page":"205-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Independent Set in\u00a0k-Claw-Free Graphs: Conditional $$\\chi $$-Boundedness and\u00a0the\u00a0Power of\u00a0LP\/SDP Relaxations"],"prefix":"10.1007","author":[{"given":"Parinya","family":"Chalermsook","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ameet","family":"Gadekar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamyar","family":"Khodamoradi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"issue":"1","key":"15_CR1","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. Theory Comput. 7(1), 27\u201343 (2011)","journal-title":"Theory Comput."},{"doi-asserted-by":"crossref","unstructured":"Bansal, N., Gupta, A., Guruganesh, G.: On the Lov\u00e1sz theta function for independent sets in sparse graphs. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 193\u2013200 (2015)","key":"15_CR2","DOI":"10.1145\/2746539.2746607"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-44985-X_19","volume-title":"Algorithm Theory - SWAT 2000","author":"P Berman","year":"2000","unstructured":"Berman, P.: A d\/2 approximation for maximum weight independent set in $$d$$-claw free graphs. In: SWAT 2000. LNCS, vol. 1851, pp. 214\u2013219. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44985-X_19"},{"doi-asserted-by":"publisher","unstructured":"Bohman, T.: The triangle-free process. Adv. Math. 221(5), 1653\u20131677 (2009). https:\/\/doi.org\/10.1016\/j.aim.2009.02.018. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0001870809000620","key":"15_CR4","DOI":"10.1016\/j.aim.2009.02.018"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00222-010-0247-x","volume":"181","author":"T Bohman","year":"2010","unstructured":"Bohman, T., Keevash, P.: The early evolution of the h-free process. Invent. Math. 181(2), 291\u2013336 (2010)","journal-title":"Invent. Math."},{"doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Chuzhoy, J.: Maximum independent set of rectangles. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 892\u2013901. SIAM (2009)","key":"15_CR6","DOI":"10.1137\/1.9781611973068.97"},{"doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Gadekar, A., Khodamoradi, K., Spoerhase, J.: Independent set in $$k$$-claw-free graphs: conditional $$\\chi $$-boundedness and the power of LP\/SDP relaxations (2023)","key":"15_CR7","DOI":"10.1007\/978-3-031-49815-2_15"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.endm.2016.10.029","volume":"55","author":"P Chalermsook","year":"2016","unstructured":"Chalermsook, P., Vaz, D.: A note on fractional coloring and the integrality gap of LP for maximum weight independent set. Electron. Notes Discret. Math. 55, 113\u2013116 (2016)","journal-title":"Electron. Notes Discret. Math."},{"doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Walczak, B.: Coloring and maximum weight independent set of rectangles. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 860\u2013868. SIAM (2021)","key":"15_CR9","DOI":"10.1137\/1.9781611976465.54"},{"doi-asserted-by":"crossref","unstructured":"Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. In: Proceedings of the Twenty-Fifth Annual Symposium on Computational Geometry, pp. 333\u2013340 (2009)","key":"15_CR10","DOI":"10.1145\/1542362.1542420"},{"doi-asserted-by":"publisher","unstructured":"Chan, Y.H., Lau, L.C.: On Linear and Semidefinite Programming Relaxations for Hypergraph Matching, pp. 1500\u20131511. https:\/\/doi.org\/10.1137\/1.9781611973075.122. https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611973075.122","key":"15_CR11","DOI":"10.1137\/1.9781611973075.122"},{"issue":"2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1006\/jagm.2000.1155","volume":"39","author":"B Chandra","year":"2001","unstructured":"Chandra, B., Halld\u00f3rsson, M.M.: Greedy local improvement and weighted set packing approximation. J. Algorithms 39(2), 223\u2013240 (2001)","journal-title":"J. Algorithms"},{"doi-asserted-by":"publisher","unstructured":"Chudnovsky, M., Seymour, P.: Claw-free graphs VI. colouring. J. Comb. Theory Ser. B 100(6), 560\u2013572 (2010). https:\/\/doi.org\/10.1016\/j.jctb.2010.04.005. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S009589561000064X","key":"15_CR13","DOI":"10.1016\/j.jctb.2010.04.005"},{"doi-asserted-by":"crossref","unstructured":"Cygan, M.: Improved approximation for 3-dimensional matching via bounded pathwidth local search. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 509\u2013518. IEEE (2013)","key":"15_CR14","DOI":"10.1109\/FOCS.2013.61"},{"doi-asserted-by":"crossref","unstructured":"Fleming, N., Kothari, P., Pitassi, T., et al.: Semialgebraic proofs and efficient algorithm design. Found. Trends\u00ae Theor. Comput. Sci. 14(1\u20132), 1\u2013221 (2019)","key":"15_CR15","DOI":"10.1561\/0400000086"},{"doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs. In: North-Holland Mathematics Studies, vol. 88, pp. 325\u2013356. Elsevier (1984)","key":"15_CR16","DOI":"10.1016\/S0304-0208(08)72943-8"},{"issue":"1","key":"15_CR17","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Comput. Complex. 15(1), 20\u201339 (2006)","journal-title":"Comput. Complex."},{"issue":"3","key":"15_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(83)90080-X","volume":"6","author":"DS Hochbaum","year":"1983","unstructured":"Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover and set packing problems. Discret. Appl. Math. 6(3), 243\u2013254 (1983)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"15_CR19","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/rsa.3240070302","volume":"7","author":"JH Kim","year":"1995","unstructured":"Kim, J.H.: The Ramsey number $$R(3, t)$$ has order of magnitude $$t^2\/\\log t$$. Random Struct. Algorithms 7(3), 173\u2013207 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-45535-3_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programs. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 293\u2013303. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45535-3_23"},{"issue":"3","key":"15_CR21","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"15_CR22","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the sherali-adams, lov\u00e1sz-schrijver, and lasserre relaxations for 0\u20131 programming. Math. Oper. Res. 28(3), 470\u2013496 (2003)","journal-title":"Math. Oper. Res."},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/3-540-45753-4_19","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"L Lewin-Eytan","year":"2002","unstructured":"Lewin-Eytan, L., Naor, J.S., Orda, A.: Routing and admission control in networks with advance reservations. In: Jansen, K., Leonardi, S., Vazirani, V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 215\u2013228. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45753-4_19"},{"issue":"2","key":"15_CR24","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","volume":"13","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: A characterization of perfect graphs. J. Comb. Theory Ser. B 13(2), 95\u201398 (1972)","journal-title":"J. Comb. Theory Ser. B"},{"doi-asserted-by":"publisher","unstructured":"Neuwohner, M.: An improved approximation algorithm for the maximum weight independent set problem in d-claw free graphs. In: Bl\u00e4ser, M., Monmege, B. (eds.) 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, Saarbr\u00fccken, Germany, 16\u201319 March 2021 (Virtual Conference). LIPIcs, vol. 187, pp. 53:1\u201353:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.53","key":"15_CR25","DOI":"10.4230\/LIPIcs.STACS.2021.53"},{"unstructured":"Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. California Institute of Technology (2000)","key":"15_CR26"},{"key":"15_CR27","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, 293\u2013320 (2003)","journal-title":"Math. Program."},{"unstructured":"Rothvo\u00df, T.: The Lasserre hierarchy in approximation algorithms. Lecture Notes for the MAPSP, pp. 1\u201325 (2013)","key":"15_CR28"},{"issue":"3","key":"15_CR29","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/jgt.22601","volume":"95","author":"A Scott","year":"2020","unstructured":"Scott, A., Seymour, P.: A survey of $$\\chi $$-boundedness. J. Graph Theory 95(3), 473\u2013504 (2020)","journal-title":"J. Graph Theory"},{"issue":"3","key":"15_CR30","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discret. Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discret. Math."},{"doi-asserted-by":"publisher","unstructured":"Thiery, T., Ward, J.: An improved approximation for maximum weighted k-set packing. In: Bansal, N., Nagarajan, V. (eds.) Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, 22\u201325 January 2023, pp. 1138\u20131162. SIAM (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.ch42","key":"15_CR31","DOI":"10.1137\/1.9781611977554.ch42"},{"unstructured":"Yang, J.: On coloring claw-free graphs (2007). https:\/\/www.mathcs.bethel.edu\/yang\/papers\/clawfree.pdf","key":"15_CR32"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49815-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T23:04:44Z","timestamp":1703804684000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49815-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031498145","9783031498152"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49815-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2023\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"43","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":"16","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":"37% - 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.05","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":"7.7","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)"}}]}}