{"id":"https://openalex.org/W2077158870","doi":"https://doi.org/10.1145/1378533.1378540","title":"What can be approximated locally?","display_name":"What can be approximated locally?","publication_year":2008,"publication_date":"2008-06-14","ids":{"openalex":"https://openalex.org/W2077158870","doi":"https://doi.org/10.1145/1378533.1378540","mag":"2077158870"},"language":"en","primary_location":{"id":"doi:10.1145/1378533.1378540","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1378533.1378540","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"article","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/A5006005471","display_name":"Christoph Lenzen","orcid":"https://orcid.org/0000-0002-3290-0674"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Christoph Lenzen","raw_affiliation_strings":["ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084512321","display_name":"Yvonne Anne Oswald","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Yvonne Anne Oswald","raw_affiliation_strings":["ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078339613","display_name":"Roger Wattenhofer","orcid":"https://orcid.org/0000-0002-6339-3134"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Roger Wattenhofer","raw_affiliation_strings":["ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5006005471"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":6.8089,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.96959815,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"46","last_page":"54"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983999729156494,"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/constant","display_name":"Constant (computer programming)","score":0.7423844933509827},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7068720459938049},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5961686372756958},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5367940664291382},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5060543417930603},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49202534556388855},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4451597034931183},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4233625531196594},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3924295902252197},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3496726155281067},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.338246613740921},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3175130784511566}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7423844933509827},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7068720459938049},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5961686372756958},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5367940664291382},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5060543417930603},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49202534556388855},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4451597034931183},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4233625531196594},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3924295902252197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3496726155281067},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.338246613740921},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3175130784511566},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1378533.1378540","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1378533.1378540","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1489660296","https://openalex.org/W1502033971","https://openalex.org/W1521888058","https://openalex.org/W1547520624","https://openalex.org/W1568961751","https://openalex.org/W1592899943","https://openalex.org/W1869515244","https://openalex.org/W1964089073","https://openalex.org/W1964932074","https://openalex.org/W1971426115","https://openalex.org/W1975595616","https://openalex.org/W1997707549","https://openalex.org/W1998137177","https://openalex.org/W2011039300","https://openalex.org/W2017345786","https://openalex.org/W2052811387","https://openalex.org/W2054910423","https://openalex.org/W2063572899","https://openalex.org/W2067661972","https://openalex.org/W2090222354","https://openalex.org/W2100061495","https://openalex.org/W2104432491","https://openalex.org/W2114986147","https://openalex.org/W2127622665","https://openalex.org/W2165441947","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3216105633","https://openalex.org/W1701875187","https://openalex.org/W2990956612","https://openalex.org/W2906860838","https://openalex.org/W4230677477","https://openalex.org/W2118860231","https://openalex.org/W2028468530","https://openalex.org/W2419219947","https://openalex.org/W3102280101","https://openalex.org/W2963656294"],"abstract_inverted_index":{"Whether":[0],"local":[1],"algorithms":[2,20],"can":[3],"compute":[4],"constant":[5,66,69],"approximations":[6],"of":[7,11],"NP-hard":[8],"problems":[9],"is":[10],"both":[12],"practical":[13],"and":[14],"theoretical":[15],"interest.":[16],"So":[17],"far,":[18],"no":[19],"achieving":[21],"this":[22,47],"goal":[23],"are":[24,40],"known,":[25],"as":[26],"either":[27],"the":[28,32,38,51,72],"approximation":[29],"ratio":[30],"or":[31,37],"running":[33],"time":[34],"exceed":[35],"O(1),":[36],"nodes":[39,73],"provided":[41],"with":[42],"non-trivial":[43],"additional":[44,78],"information.":[45,79],"In":[46],"paper,":[48],"we":[49],"present":[50],"first":[52],"distributed":[53],"algorithm":[54],"approximating":[55],"a":[56,61,65],"minimum":[57],"dominating":[58],"set":[59],"on":[60],"planar":[62],"graph":[63],"within":[64],"factor":[67],"in":[68],"time.":[70],"Moreover,":[71],"do":[74],"not":[75],"need":[76],"any":[77]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}