{"id":"https://openalex.org/W1547915777","doi":"https://doi.org/10.1007/978-3-642-17517-6_31","title":"Analysis of an Iterated Local Search Algorithm for\u00a0Vertex\u00a0Coloring","display_name":"Analysis of an Iterated Local Search Algorithm for\u00a0Vertex\u00a0Coloring","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1547915777","doi":"https://doi.org/10.1007/978-3-642-17517-6_31","mag":"1547915777"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-17517-6_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-17517-6_31","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018789989","display_name":"Dirk Sudholt","orcid":"https://orcid.org/0000-0001-6020-1646"},"institutions":[{"id":"https://openalex.org/I1297971548","display_name":"International Computer Science Institute","ror":"https://ror.org/01ewh7m12","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1297971548"]},{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"Dirk Sudholt","raw_affiliation_strings":["Cercia, University of Birmingham, Birmingham, B15\u00a02TT, UK","International Computer Science Institute, Berkeley, CA, 94704, USA","International Computer Science Institute","Cercia, University of Birmingham"],"affiliations":[{"raw_affiliation_string":"Cercia, University of Birmingham, Birmingham, B15\u00a02TT, UK","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"International Computer Science Institute, Berkeley, CA, 94704, USA","institution_ids":["https://openalex.org/I1297971548"]},{"raw_affiliation_string":"International Computer Science Institute","institution_ids":["https://openalex.org/I1297971548"]},{"raw_affiliation_string":"Cercia, University of Birmingham","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083499604","display_name":"Christine Zarges","orcid":"https://orcid.org/0000-0002-2829-4296"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christine Zarges","raw_affiliation_strings":["Technische Universit\u00e4t Dortmund, 44221, Dortmund, Germany","Technische Universit\u00e4t, Dortmund"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Dortmund, 44221, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Technische Universit\u00e4t, Dortmund","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018789989"],"corresponding_institution_ids":["https://openalex.org/I1297971548","https://openalex.org/I79619799"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.0508,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.93199904,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"340","last_page":"352"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"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.9998999834060669,"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.9954000115394592,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9879999756813049,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.7172635793685913},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7022672891616821},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.6282138228416443},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.610996663570404},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6050816178321838},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5785746574401855},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5211967825889587},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4907301664352417},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45460623502731323},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4110490083694458},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3919624388217926},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3493710160255432},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3399369716644287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33820217847824097},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11072540283203125},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.07526895403862}],"concepts":[{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.7172635793685913},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7022672891616821},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.6282138228416443},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.610996663570404},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6050816178321838},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5785746574401855},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5211967825889587},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4907301664352417},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45460623502731323},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4110490083694458},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3919624388217926},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3493710160255432},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3399369716644287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33820217847824097},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11072540283203125},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.07526895403862},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-17517-6_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-17517-6_31","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/fd89be1b-9ef6-44ed-a3ab-2a130a7f0a08","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/fd89be1b-9ef6-44ed-a3ab-2a130a7f0a08","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sudholt, D, Zarges, C, Cheong, O, Chwa, K-Y & Park, K 2010, 'Analysis of an Iterated Local Search Algorithm for Vertex Coloring', pp. 340-352. https://doi.org/10.1007/978-3-642-17517-6_31","raw_type":"conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W133641357","https://openalex.org/W345637930","https://openalex.org/W390146837","https://openalex.org/W1492259452","https://openalex.org/W1507811735","https://openalex.org/W1511990050","https://openalex.org/W1517539929","https://openalex.org/W1559942958","https://openalex.org/W1564988901","https://openalex.org/W1582334898","https://openalex.org/W1591382005","https://openalex.org/W1957053378","https://openalex.org/W1975791498","https://openalex.org/W1980841486","https://openalex.org/W2025746323","https://openalex.org/W2034499376","https://openalex.org/W2041174023","https://openalex.org/W2044573924","https://openalex.org/W2069413879","https://openalex.org/W2076588308","https://openalex.org/W2081990166","https://openalex.org/W2093938881","https://openalex.org/W2119396705","https://openalex.org/W2127516144","https://openalex.org/W2132991500","https://openalex.org/W2148948822","https://openalex.org/W2160241726","https://openalex.org/W2476848496","https://openalex.org/W2482318024","https://openalex.org/W2709548225","https://openalex.org/W2799004609","https://openalex.org/W2905110430","https://openalex.org/W3121748795"],"related_works":["https://openalex.org/W2887485518","https://openalex.org/W2168643276","https://openalex.org/W4384024618","https://openalex.org/W2911754124","https://openalex.org/W2123829500","https://openalex.org/W3038892751","https://openalex.org/W103840550","https://openalex.org/W2305572622","https://openalex.org/W1560551466","https://openalex.org/W2517831099"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}