{"id":"https://openalex.org/W4381280171","doi":"https://doi.org/10.1145/3603112","title":"SAT-boosted Tabu Search for Coloring Massive Graphs","display_name":"SAT-boosted Tabu Search for Coloring Massive Graphs","publication_year":2023,"publication_date":"2023-05-30","ids":{"openalex":"https://openalex.org/W4381280171","doi":"https://doi.org/10.1145/3603112"},"language":"en","primary_location":{"id":"doi:10.1145/3603112","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3603112","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3603112","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3603112","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017525048","display_name":"Andr\u00e9 Schidler","orcid":"https://orcid.org/0000-0001-6790-7158"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Andr\u00e9 Schidler","raw_affiliation_strings":["TU Wien, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037092803","display_name":"Stefan Szeider","orcid":"https://orcid.org/0000-0001-8994-1656"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Stefan Szeider","raw_affiliation_strings":["TU Wien, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017525048"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":1.2727,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.81167939,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"28","issue":null,"first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/tabu-search","display_name":"Tabu search","score":0.776128351688385},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.7388408184051514},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.6784467697143555},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5815908908843994},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45066770911216736},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.44404274225234985},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.44175344705581665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.419948548078537},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4131402373313904},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3819606602191925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37675774097442627},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37554746866226196},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3206673562526703},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.28715819120407104},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.20347991585731506}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.776128351688385},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.7388408184051514},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.6784467697143555},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5815908908843994},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45066770911216736},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.44404274225234985},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.44175344705581665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.419948548078537},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4131402373313904},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3819606602191925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37675774097442627},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37554746866226196},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3206673562526703},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.28715819120407104},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.20347991585731506}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3603112","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3603112","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3603112","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3603112","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3603112","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3603112","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G29884786","display_name":null,"funder_award_id":"ICT19-065","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"}],"funders":[{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320332869","display_name":"College of Computing","ror":"https://ror.org/01zkghx44"},{"id":"https://openalex.org/F4320333063","display_name":"Stanford Bio-X","ror":"https://ror.org/00f54p054"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4381280171.pdf","grobid_xml":"https://content.openalex.org/works/W4381280171.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W82625556","https://openalex.org/W1995561296","https://openalex.org/W2024143101","https://openalex.org/W2036265926","https://openalex.org/W2064850189","https://openalex.org/W2087215158","https://openalex.org/W2131169256","https://openalex.org/W2131550405","https://openalex.org/W2167036627","https://openalex.org/W2399627189","https://openalex.org/W2401610261","https://openalex.org/W2469279958","https://openalex.org/W2741258438","https://openalex.org/W2744965439","https://openalex.org/W2745231626","https://openalex.org/W2750387007","https://openalex.org/W2906859624","https://openalex.org/W2946558358","https://openalex.org/W2948605263","https://openalex.org/W2963101915","https://openalex.org/W2965854419","https://openalex.org/W2969659548","https://openalex.org/W3132945514","https://openalex.org/W4226530376","https://openalex.org/W4238780727","https://openalex.org/W4307989683","https://openalex.org/W4361003657","https://openalex.org/W4366444575","https://openalex.org/W4377967930","https://openalex.org/W4382239928","https://openalex.org/W6810898799","https://openalex.org/W6850344330"],"related_works":["https://openalex.org/W2041526935","https://openalex.org/W2151059773","https://openalex.org/W1542397451","https://openalex.org/W1974068132","https://openalex.org/W2293855371","https://openalex.org/W1982933944","https://openalex.org/W2018072810","https://openalex.org/W4288274833","https://openalex.org/W4246619488","https://openalex.org/W2046684958"],"abstract_inverted_index":{"Graph":[0],"coloring":[1,6,89,111],"is":[2,22,59],"the":[3,7,25,56,76,91],"problem":[4],"of":[5,9,24],"vertices":[8,128],"a":[10,102,115],"graph":[11,41,88],"with":[12,72,114,124],"as":[13,16],"few":[14],"colors":[15],"possible,":[17],"avoiding":[18],"monochromatic":[19],"edges.":[20,133],"It":[21],"one":[23],"most":[26,77],"fundamental":[27],"NP-hard":[28],"computational":[29],"problems.":[30],"For":[31,64],"decades":[32],"researchers":[33],"have":[34,69],"developed":[35],"exact":[36,54],"and":[37,110,129],"heuristic":[38,67],"methods":[39,44,68,144],"for":[40,61,87],"coloring.":[42],"While":[43],"based":[45],"on":[46,145],"propositional":[47],"satisfiability":[48],"(SAT)":[49],"feature":[50],"prominently":[51],"among":[52,75],"these":[53],"methods,":[55],"encoding":[57],"size":[58],"prohibitive":[60],"large":[62,146],"graphs.":[63,148],"such":[65],"graphs,":[66],"been":[70],"proposed,":[71],"tabu":[73,85],"search":[74,86],"successful":[78],"ones.":[79],"In":[80],"this":[81],"article,":[82],"we":[83],"enhance":[84],"within":[90],"SAT-based":[92],"local":[93],"improvement":[94],"(SLIM)":[95],"framework.":[96],"Our":[97,134],"hybrid":[98,140],"algorithm":[99,141],"incrementally":[100],"improves":[101],"candidate":[103],"solution":[104],"by":[105],"repeatedly":[106],"selecting":[107],"small":[108],"subgraphs":[109],"them":[112],"optimally":[113],"SAT":[116],"solver.":[117],"This":[118],"approach":[119],"scales":[120],"to":[121],"dense":[122,147],"graphs":[123],"several":[125],"hundred":[126],"thousand":[127],"over":[130],"1.5":[131],"billion":[132],"experimental":[135],"evaluation":[136],"shows":[137],"that":[138],"our":[139],"beats":[142],"state-of-the-art":[143]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}