{"id":"https://openalex.org/W4391912941","doi":"https://doi.org/10.1145/3583131.3590353","title":"Finding Near-Optimal Weight Independent Sets at Scale","display_name":"Finding Near-Optimal Weight Independent Sets at Scale","publication_year":2023,"publication_date":"2023-07-12","ids":{"openalex":"https://openalex.org/W4391912941","doi":"https://doi.org/10.1145/3583131.3590353"},"language":"en","primary_location":{"id":"doi:10.1145/3583131.3590353","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3583131.3590353","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3583131.3590353&file=p293-gromann-suppl.pdf","source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3583131.3590353&file=p293-gromann-suppl.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048579850","display_name":"Ernestine Gro\u00dfmann","orcid":"https://orcid.org/0000-0002-9678-0253"},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ernestine Gro\u00dfmann","raw_affiliation_strings":["Heidelberg University, Heidelberg, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9678-0253","affiliations":[{"raw_affiliation_string":"Heidelberg University, Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074563859","display_name":"Sebastian Lamm","orcid":"https://orcid.org/0000-0001-7828-921X"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Lamm","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany"],"raw_orcid":"https://orcid.org/0000-0001-7828-921X","affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059665527","display_name":"Christian Schulz","orcid":"https://orcid.org/0000-0002-2823-3506"},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Schulz","raw_affiliation_strings":["Heidelberg University, Heidelberg, Germany"],"raw_orcid":"https://orcid.org/0000-0002-2823-3506","affiliations":[{"raw_affiliation_string":"Heidelberg University, Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066225806","display_name":"Darren Strash","orcid":"https://orcid.org/0000-0001-7095-8749"},"institutions":[{"id":"https://openalex.org/I188592606","display_name":"Hamilton College","ror":"https://ror.org/05709zb94","country_code":"US","type":"education","lineage":["https://openalex.org/I188592606"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Darren Strash","raw_affiliation_strings":["Department of Computer Science, Hamilton College, Clinton, United States of America"],"raw_orcid":"https://orcid.org/0000-0001-7095-8749","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Hamilton College, Clinton, United States of America","institution_ids":["https://openalex.org/I188592606"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5503,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62318841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"480","issue":null,"first_page":"293","last_page":"302"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6414629220962524},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.6313457489013672},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5639448761940002},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5244771838188171},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4785086214542389},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4278866946697235},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4278740882873535},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4111385941505432},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35653966665267944},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32963573932647705},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3206239342689514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2783694565296173},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.22523367404937744}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6414629220962524},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.6313457489013672},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5639448761940002},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5244771838188171},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4785086214542389},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4278866946697235},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4278740882873535},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4111385941505432},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35653966665267944},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32963573932647705},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3206239342689514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2783694565296173},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.22523367404937744},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3583131.3590353","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3583131.3590353","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3583131.3590353&file=p293-gromann-suppl.pdf","source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3583131.3590353","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3583131.3590353","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3583131.3590353&file=p293-gromann-suppl.pdf","source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1338050156","display_name":null,"funder_award_id":"DFG SCHU 2567-3-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4391912941.pdf","grobid_xml":"https://content.openalex.org/works/W4391912941.grobid-xml"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W9324657","https://openalex.org/W151632460","https://openalex.org/W1508964797","https://openalex.org/W1573405943","https://openalex.org/W1594785451","https://openalex.org/W1759050275","https://openalex.org/W1832306393","https://openalex.org/W1989826169","https://openalex.org/W1993131108","https://openalex.org/W1994203526","https://openalex.org/W2003579987","https://openalex.org/W2008362324","https://openalex.org/W2035080386","https://openalex.org/W2043005464","https://openalex.org/W2046112356","https://openalex.org/W2068262026","https://openalex.org/W2068617151","https://openalex.org/W2098667053","https://openalex.org/W2103112216","https://openalex.org/W2103159428","https://openalex.org/W2166658744","https://openalex.org/W2441524006","https://openalex.org/W2513955757","https://openalex.org/W2522302778","https://openalex.org/W2589796617","https://openalex.org/W2594540369","https://openalex.org/W2604438066","https://openalex.org/W2807782272","https://openalex.org/W2898323380","https://openalex.org/W2912725667","https://openalex.org/W2950295097","https://openalex.org/W2962800229","https://openalex.org/W3009034468","https://openalex.org/W3010460567","https://openalex.org/W3030122542","https://openalex.org/W3117444004","https://openalex.org/W3156065822","https://openalex.org/W3167767658","https://openalex.org/W3211025827","https://openalex.org/W4229716298","https://openalex.org/W4242819335","https://openalex.org/W4243118528","https://openalex.org/W4281676310","https://openalex.org/W4293819625","https://openalex.org/W4412258646"],"related_works":["https://openalex.org/W2010336970","https://openalex.org/W4205193211","https://openalex.org/W2073435288","https://openalex.org/W2952838392","https://openalex.org/W2148431844","https://openalex.org/W2106802199","https://openalex.org/W2007607373","https://openalex.org/W4286235874","https://openalex.org/W3184115741","https://openalex.org/W4308357971"],"abstract_inverted_index":{"Computing":[0],"maximum":[1],"weight":[2],"independent":[3,82,107,133,147,192],"sets":[4,83,134,148,193],"in":[5,20,84,104,131,198],"graphs":[6,22,43],"is":[7,15],"an":[8,64],"important":[9],"NP-hard":[10],"optimization":[11],"problem.":[12],"The":[13],"problem":[14],"particularly":[16],"difficult":[17],"to":[18,54,68,78,95,102,129,158,195],"solve":[19,40],"large":[21],"for":[23,176],"which":[24,72],"data":[25,75],"reduction":[26,76,138],"techniques":[27,77],"do":[28],"not":[29],"work":[30],"well.":[31],"To":[32],"be":[33,103,130,184,196],"more":[34],"precise,":[35],"state-of-the-art":[36,160],"branch-and-reduce":[37],"algorithms":[38,175],"can":[39,183],"many":[41],"large-scale":[42],"if":[44],"reductions":[45],"are":[46,100,156],"applicable.":[47],"Otherwise,":[48],"their":[49],"performance":[50],"quickly":[51],"degrades":[52],"due":[53],"branching":[55],"requiring":[56],"exponential":[57],"time.":[58],"In":[59],"this":[60],"paper,":[61],"we":[62,90,155],"develop":[63],"advanced":[65],"memetic":[66,93],"algorithm":[67,166],"tackle":[69],"the":[70,114,119,137,143,169],"problem,":[71],"incorporates":[73],"recent":[74],"compute":[79,168],"near-optimal":[80],"weighted":[81],"huge":[85],"sparse":[86],"networks.":[87],"More":[88],"precisely,":[89],"use":[91],"a":[92,105,187],"approach":[94],"recursively":[96],"choose":[97],"vertices":[98,112,127],"that":[99,123,154],"likely":[101,128],"large-weight":[106,132,146,191],"set.":[108],"We":[109,121],"include":[110],"these":[111],"into":[113],"solution,":[115],"and":[116,125,140],"further":[117],"reduce":[118],"graph.":[120],"show":[122],"identifying":[124],"removing":[126],"opens":[135],"up":[136,142],"space":[139],"speeds":[141],"computation":[144],"of":[145,179],"remarkably.":[149],"Our":[150],"experimental":[151],"evaluation":[152],"indicates":[153],"able":[157],"outperform":[159],"algorithms.":[161],"For":[162],"example,":[163],"our":[164],"two":[165],"configurations":[167],"best":[170],"results":[171],"among":[172],"all":[173],"competing":[174],"205":[177],"out":[178],"207":[180],"instances.":[181],"Thus":[182],"seen":[185],"as":[186],"useful":[188],"tool":[189],"when":[190],"need":[194],"computed":[197],"practice.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}