{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T22:41:19Z","timestamp":1778539279510,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T00:00:00Z","timestamp":1689120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["DFG SCHU 2567-3-1"],"award-info":[{"award-number":["DFG SCHU 2567-3-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583131.3590353","type":"proceedings-article","created":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T06:35:26Z","timestamp":1708238126000},"page":"293-302","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding Near-Optimal Weight Independent Sets at Scale"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9678-0253","authenticated-orcid":false,"given":"Ernestine","family":"Gro\u00dfmann","sequence":"first","affiliation":[{"name":"Heidelberg University, Heidelberg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7828-921X","authenticated-orcid":false,"given":"Sebastian","family":"Lamm","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2823-3506","authenticated-orcid":false,"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[{"name":"Heidelberg University, Heidelberg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7095-8749","authenticated-orcid":false,"given":"Darren","family":"Strash","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Hamilton College, Clinton, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"[n. d.]. OpenStreetMap. https:\/\/www.openstreetmap.org ([n. d.]). https:\/\/www.openstreetmap.org"},{"key":"e_1_3_2_2_2_1","unstructured":"[n. d.]. SuiteSparce Matrix Collection. https:\/\/sparse.tamu.edu ([n. d.]). https:\/\/sparse.tamu.edu"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-21534-6_6"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.023"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00388-3"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-012-9196-4"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02243394"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215075"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996913.2996957"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.07.004"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/196"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2205.13202"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2022.45"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)72955-4"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3013558.3013580"},{"key":"e_1_3_2_2_17_1","volume-title":"Johnson","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976472.10"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851493"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2208.13645"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-007-9055-x"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467232"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0042-3"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976229.1"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-89543-3_51"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Hua Jiang Chu-Min Li and Felip Manya. 2017. An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs.. In AAAI. 830--838.","DOI":"10.1609\/aaai.v31i1.10648"},{"key":"e_1_3_2_2_27_1","volume-title":"Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference (GECCO'11)","author":"Kim J.","unstructured":"J. Kim, I. Hwang, Y. H. Kim, and B. R. Moon. 2011. Genetic Approaches for Graph Partitioning: A Survey. In Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference (GECCO'11). ACM, 473--480."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20086-6_6"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-017-9337-x"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975499.12"},{"key":"e_1_3_2_2_31_1","volume-title":"Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural Networks. In 20th International Symposium on Experimental Algorithms (SEA","author":"Langedal Kenneth","year":"2022","unstructured":"Kenneth Langedal, Johannes Langguth, Fredrik Manne, and Daniel Thilo Schroeder. 2022. Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural Networks. In 20th International Symposium on Experimental Algorithms (SEA 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_2_32_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. URL http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.02.017"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2019.1621218"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7495"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1996.4.2.113"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-017-1128-7"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00290-6"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-009-9264-3"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-011-0431-y"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.07.019"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409060.1409097"},{"key":"e_1_3_2_2_43_1","unstructured":"P. Sanders and C. Schulz. [n. d.]. KaHIP - Karlsruhe High Qualtity Partitioning Homepage. ([n. d.]). http:\/\/algo2.iti.kit.edu\/documents\/kahip\/index.html."},{"key":"e_1_3_2_2_44_1","volume-title":"Engineering Multilevel Graph Partitioning Algorithms. In 19th European Symposium on Algorithms (LNCS","volume":"480","author":"Sanders P.","unstructured":"P. Sanders and C. Schulz. 2011. Engineering Multilevel Graph Partitioning Algorithms. In 19th European Symposium on Algorithms (LNCS, Vol. 6942). Springer, 469--480."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-38851-9_20"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77525-8_312"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOGO.0000042115.44455.f3"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11440-3_18"},{"key":"e_1_3_2_2_49_1","unstructured":"Jeffrey S Warren and Illya V Hicks. 2006. Combinatorial branch-and-bound for the maximum weight independent set problem. (2006). https:\/\/www.caam.rice.edu\/~ivhicks\/jeff.rev.pdf"},{"key":"e_1_3_2_2_50_1","unstructured":"Deepak Warrier. 2007. A branch price and cut approach to solving the maximum weighted independent set problem. Ph. D. Dissertation. Texas A&M University. 1\/5814 1969"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20088"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.07.027"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450130"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33954-2_28"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00216"}],"event":{"name":"GECCO '23: Genetic and Evolutionary Computation Conference","location":"Lisbon Portugal","acronym":"GECCO '23","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583131.3590353","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583131.3590353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:48Z","timestamp":1750182528000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583131.3590353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,12]]},"references-count":55,"alternative-id":["10.1145\/3583131.3590353","10.1145\/3583131"],"URL":"https:\/\/doi.org\/10.1145\/3583131.3590353","relation":{},"subject":[],"published":{"date-parts":[[2023,7,12]]},"assertion":[{"value":"2023-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}