{"id":"https://openalex.org/W2503706701","doi":"https://doi.org/10.1145/2933057.2933068","title":"Brief Announcement","display_name":"Brief Announcement","publication_year":2016,"publication_date":"2016-07-25","ids":{"openalex":"https://openalex.org/W2503706701","doi":"https://doi.org/10.1145/2933057.2933068","mag":"2503706701"},"language":"en","primary_location":{"id":"doi:10.1145/2933057.2933068","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933068","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","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/A5054700318","display_name":"Marijke H.L. Bodlaender","orcid":null},"institutions":[{"id":"https://openalex.org/I123185442","display_name":"Reykjav\u00edk University","ror":"https://ror.org/05d2kyx68","country_code":"IS","type":"education","lineage":["https://openalex.org/I123185442"]}],"countries":["IS"],"is_corresponding":true,"raw_author_name":"Marijke H.L. Bodlaender","raw_affiliation_strings":["Reykjavik University, Reykjavik, Iceland"],"affiliations":[{"raw_affiliation_string":"Reykjavik University, Reykjavik, Iceland","institution_ids":["https://openalex.org/I123185442"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019056248","display_name":"Magn\u00fas M. Halld\u00f3rsson","orcid":"https://orcid.org/0000-0002-5774-8437"},"institutions":[{"id":"https://openalex.org/I123185442","display_name":"Reykjav\u00edk University","ror":"https://ror.org/05d2kyx68","country_code":"IS","type":"education","lineage":["https://openalex.org/I123185442"]}],"countries":["IS"],"is_corresponding":false,"raw_author_name":"Magn\u00fas M. Halld\u00f3rsson","raw_affiliation_strings":["Reykjavik University, Reykjavik, Iceland"],"affiliations":[{"raw_affiliation_string":"Reykjavik University, Reykjavik, Iceland","institution_ids":["https://openalex.org/I123185442"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054336577","display_name":"Christian Konrad","orcid":"https://orcid.org/0000-0003-1802-4011"},"institutions":[{"id":"https://openalex.org/I123185442","display_name":"Reykjav\u00edk University","ror":"https://ror.org/05d2kyx68","country_code":"IS","type":"education","lineage":["https://openalex.org/I123185442"]}],"countries":["IS"],"is_corresponding":false,"raw_author_name":"Christian Konrad","raw_affiliation_strings":["Reykjavik University, Reykjavik, Iceland"],"affiliations":[{"raw_affiliation_string":"Reykjavik University, Reykjavik, Iceland","institution_ids":["https://openalex.org/I123185442"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023808567","display_name":"Fabian K\u00fchn","orcid":"https://orcid.org/0000-0002-1025-5037"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Fabian Kuhn","raw_affiliation_strings":["University of Freiburg, Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"University of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5054700318"],"corresponding_institution_ids":["https://openalex.org/I123185442"],"apc_list":null,"apc_paid":null,"fwci":3.2348,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.92459968,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"93","last_page":"95"},"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.9987000226974487,"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.9980000257492065,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7838079929351807},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6468594074249268},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5406896471977234},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5001506805419922},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49650317430496216},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.494639128446579},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4907906949520111},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4523707926273346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4047201871871948},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3408082127571106},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11027878522872925},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07533568143844604}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7838079929351807},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6468594074249268},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5406896471977234},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5001506805419922},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49650317430496216},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.494639128446579},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4907906949520111},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4523707926273346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4047201871871948},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3408082127571106},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11027878522872925},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07533568143844604},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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":2,"locations":[{"id":"doi:10.1145/2933057.2933068","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933068","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/2137346d-30b8-436e-a930-9eb104a82c54","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/2137346d-30b8-436e-a930-9eb104a82c54","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bodlaender, M H L, Halld\u00f3rsson, M M, Konrad, C & Kuhn, F 2016, Brief Announcement: Local Independent Set Approximation. in Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016. pp. 93-95. https://doi.org/10.1145/2933057.2933068","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6768426468","display_name":null,"funder_award_id":"120032011, 152679-051","funder_id":"https://openalex.org/F4320321020","funder_display_name":"Icelandic Centre for Research"}],"funders":[{"id":"https://openalex.org/F4320321020","display_name":"Icelandic Centre for Research","ror":"https://ror.org/03srneg48"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1501644705","https://openalex.org/W1996066664","https://openalex.org/W1998544343","https://openalex.org/W1998643836","https://openalex.org/W2054910423","https://openalex.org/W2081254453","https://openalex.org/W2137594557","https://openalex.org/W2138623498","https://openalex.org/W2165441947","https://openalex.org/W2169324896","https://openalex.org/W2294280173","https://openalex.org/W2487418934","https://openalex.org/W4235946010"],"related_works":["https://openalex.org/W2953461625","https://openalex.org/W2567825307","https://openalex.org/W1592682627","https://openalex.org/W4295762832","https://openalex.org/W2945016732","https://openalex.org/W2785998768","https://openalex.org/W2371352078","https://openalex.org/W2362975861","https://openalex.org/W2054458431","https://openalex.org/W2804963084"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,24,36],"the":[3,7,19],"first":[4],"phase":[5],"of":[6],"Linial-Saks":[8],"network":[9],"decomposition":[10],"algorithm":[11,17],"gives":[12],"a":[13,32],"randomized":[14],"distributed":[15],"O(n\u03b5)-approximation":[16],"for":[18,39],"maximum":[20],"independent":[21],"set":[22],"problem":[23],"operates":[25],"in":[26],"O(1/\u03b5)":[27],"rounds,":[28],"and":[29],"we":[30],"give":[31],"matching":[33],"lower":[34],"bound":[35],"holds":[37],"even":[38],"bipartite":[40],"graphs.":[41]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2016-08-23T00:00:00"}