{"id":"https://openalex.org/W2011402196","doi":"https://doi.org/10.1145/800070.802207","title":"A new approximate graph coloring algorithm","display_name":"A new approximate graph coloring algorithm","alternate_titles":[],"publication_year":1982,"publication_date":"1982-05-05","ids":{"openalex":"https://openalex.org/W2011402196","doi":"https://doi.org/10.1145/800070.802207","mag":"2011402196"},"language":"en","primary_location":{"id":"doi:10.1145/800070.802207","doi":"https://doi.org/10.1145/800070.802207","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800070.802207","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800070.802207","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fourteenth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2011402196"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/800070.802207","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039043184","display_name":"Avi Wigderson","orcid":"https://orcid.org/0000-0002-1539-1417","observed_orcids":["https://orcid.org/0000-0002-1539-1417"]},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Avi Wigderson","raw_affiliation_strings":["Electrical Engineering & Computer Science Department Princeton University Princeton,N J,08544"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering & Computer Science Department Princeton University Princeton,N J,08544","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039043184"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":1.4545,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.74449339,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"325","last_page":"329"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7728999853134155,"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.7728999853134155,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.20749999582767487,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.0066999997943639755,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-coloring","display_name":"graph coloring","score":0.9980000257492065},{"id":"https://openalex.org/keywords/chromatic-number","display_name":"chromatic number","score":0.9670000076293945}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.7120786905288696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.645164430141449},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47187915444374084},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3526453971862793},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2893454134464264}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/800070.802207","doi":"https://doi.org/10.1145/800070.802207","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800070.802207","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800070.802207","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fourteenth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/800070.802207","doi":"https://doi.org/10.1145/800070.802207","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800070.802207","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800070.802207","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fourteenth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G238744441","display_name":"Computational Complexity","funder_award_id":"8023806","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2011402196.pdf","grobid_xml":"https://content.openalex.org/works/W2011402196.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W135315161","https://openalex.org/W149461665","https://openalex.org/W1655990431","https://openalex.org/W1981455469","https://openalex.org/W2025904765","https://openalex.org/W2047598885","https://openalex.org/W2108301529","https://openalex.org/W2401610261","https://openalex.org/W2799004609"],"related_works":["https://openalex.org/W1982506822","https://openalex.org/W2092913540","https://openalex.org/W7099870388","https://openalex.org/W2000890568","https://openalex.org/W2024831296","https://openalex.org/W2068348079","https://openalex.org/W2153663865","https://openalex.org/W2099431183","https://openalex.org/W2573091839","https://openalex.org/W2111086028"],"abstract_inverted_index":{"Let":[0],"A":[1,19],"be":[2,41],"a":[3,68,78],"graph":[4,25],"coloring":[5,37,72],"algorithm.":[6],"Denote":[7],"by":[8],"\u00c0":[9,61],"(G)":[10],"the":[11,14,24,28,49,82],"ratio":[12],"between":[13],"maximum":[15],"number":[16,30,50],"of":[17,31,51],"colors":[18],"will":[20],"use":[21],"to":[22],"color":[23],"G,":[26],"and":[27,70],"chromatic":[29],"G,x(G).":[32],"For":[33],"most":[34],"existing":[35],"polynomial":[36],"algorithms,":[38],"\u00c0(G)":[39],"can":[40],"as":[42,44],"bad":[43],"O(n),":[45],"where":[46],"n":[47],"is":[48],"vertices":[52],"in":[53],"G.":[54],"The":[55],"best":[56],"currently":[57],"known":[58],"algorithm":[59,73],"guarantees":[60,75],"(G)=O(n/logn).":[62],"In":[63],"this":[64],"paper":[65],"we":[66],"present":[67],"simple":[69],"efficient":[71],"which":[74],"\u00c0(G)\u2264x(G)n":[76],"(equation),":[77],"considerable":[79],"improvem\u0117nt":[80],"over":[81],"current":[83],"bounds.":[84]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2011402196","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
