{"id":"https://openalex.org/W2117761060","doi":"https://doi.org/10.1007/11780823_10","title":"Efficient Distributed Weighted Matchings on Trees","display_name":"Efficient Distributed Weighted Matchings on Trees","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2117761060","doi":"https://doi.org/10.1007/11780823_10","mag":"2117761060"},"language":"en","primary_location":{"id":"doi:10.1007/11780823_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11780823_10","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":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2066/34862","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008216815","display_name":"Jaap-Henk Hoepman","orcid":"https://orcid.org/0000-0003-4234-1578"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jaap-Henk Hoepman","raw_affiliation_strings":["Institute for Computing and Information Sciences, Radboud University Nijmegen, Nijmegen, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computing and Information Sciences, Radboud University Nijmegen, Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033442948","display_name":"Shay Kutten","orcid":"https://orcid.org/0000-0003-2062-6855"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shay Kutten","raw_affiliation_strings":["Faculty of Industrial Engineering and Management, Technion, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Industrial Engineering and Management, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016606156","display_name":"Zvi Lotker","orcid":"https://orcid.org/0000-0002-3759-5584"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Zvi Lotker","raw_affiliation_strings":["CWI, Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CWI, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.3523,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.88056283,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"115","last_page":"129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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.9995999932289124,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9976999759674072,"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"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.995199978351593,"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/logarithm","display_name":"Logarithm","score":0.8321049213409424},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7512208223342896},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6385405659675598},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.596676230430603},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.559444010257721},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.542871356010437},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.527468204498291},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5231615304946899},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5068331360816956},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4746958613395691},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4716182053089142},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45381683111190796},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4290672242641449},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.367759108543396},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06673687696456909}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.8321049213409424},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7512208223342896},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6385405659675598},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.596676230430603},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.559444010257721},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.542871356010437},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.527468204498291},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5231615304946899},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5068331360816956},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4746958613395691},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4716182053089142},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45381683111190796},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4290672242641449},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.367759108543396},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06673687696456909},{"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/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.1007/11780823_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11780823_10","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:repository.ubn.ru.nl:2066/34862","is_oa":true,"landing_page_url":"http://hdl.handle.net/2066/34862","pdf_url":"http://hdl.handle.net/2066/34862","source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Flocchini, P. (ed.), Structural Information and Communication Complexity: 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings, pp. 115-129","raw_type":"Article in monograph or in proceedings"}],"best_oa_location":{"id":"pmh:oai:repository.ubn.ru.nl:2066/34862","is_oa":true,"landing_page_url":"http://hdl.handle.net/2066/34862","pdf_url":"http://hdl.handle.net/2066/34862","source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Flocchini, P. (ed.), Structural Information and Communication Complexity: 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings, pp. 115-129","raw_type":"Article in monograph or in proceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2117761060.pdf","grobid_xml":"https://content.openalex.org/works/W2117761060.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1485041102","https://openalex.org/W1523785148","https://openalex.org/W1534484868","https://openalex.org/W1964932074","https://openalex.org/W2003813631","https://openalex.org/W2005900781","https://openalex.org/W2023492687","https://openalex.org/W2024106841","https://openalex.org/W2033177550","https://openalex.org/W2054420170","https://openalex.org/W2101703048","https://openalex.org/W2106387257"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W2089134982","https://openalex.org/W4299305030","https://openalex.org/W2962917430","https://openalex.org/W2113270940","https://openalex.org/W2028468530","https://openalex.org/W2521054645","https://openalex.org/W4389820491","https://openalex.org/W2018076478","https://openalex.org/W1903284337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2025-10-10T00:00:00"}