乐胖代购免代理版

{"id":"https://openalex.org/W2081149067","doi":"https://doi.org/10.1109/icdsp.2013.6622738","title":"A fast matching algorithm for asymptotically optimal distributed channel assignment","display_name":"A fast matching algorithm for asymptotically optimal distributed channel assignment","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2081149067","doi":"https://doi.org/10.1109/icdsp.2013.6622738","mag":"2081149067"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdsp.2013.6622738","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5020146315","display_name":"Oshri Naparstek","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Oshri Naparstek","raw_affiliation_strings":["Electr. Eng. Dept., Bar-Ilan Univ., Ramat-Gan, Israel"],"affiliations":[{"raw_affiliation_string":"Electr. Eng. Dept., Bar-Ilan Univ., Ramat-Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019966334","display_name":"Amir Leshem","orcid":"https://orcid.org/0000-0002-2265-7463"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amir Leshem","raw_affiliation_strings":["Electr. Eng. Dept., Bar-Ilan Univ., Ramat-Gan, Israel"],"affiliations":[{"raw_affiliation_string":"Electr. Eng. Dept., Bar-Ilan Univ., Ramat-Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.683,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":12,"citation_normalized_percentile":{"value":0.783593,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":87},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987,"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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987,"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.998,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9923,"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/cardinality","display_name":"Cardinality (data modeling)","score":0.8125731},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.77532744}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.8125731},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8065423},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.77532744},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.70589215},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6756492},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.56792563},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.5647029},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.55985343},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.55124724},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.45512646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44945636},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4314595},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.41047102},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41009653},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36511573},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3620299},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12911135},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdsp.2013.6622738","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":18,"referenced_works":["https://openalex.org/W1559502586","https://openalex.org/W1993012830","https://openalex.org/W2051207929","https://openalex.org/W2059608229","https://openalex.org/W2063911102","https://openalex.org/W2068115726","https://openalex.org/W2070099460","https://openalex.org/W2077667058","https://openalex.org/W2093397942","https://openalex.org/W2106690257","https://openalex.org/W2142702167","https://openalex.org/W2156764784","https://openalex.org/W2157529519","https://openalex.org/W2163768829","https://openalex.org/W2222512263","https://openalex.org/W336109153","https://openalex.org/W4233756358","https://openalex.org/W4235234911"],"related_works":["https://openalex.org/W4212780071","https://openalex.org/W3149825000","https://openalex.org/W2937059810","https://openalex.org/W2760584304","https://openalex.org/W2382974548","https://openalex.org/W2358965113","https://openalex.org/W2311097448","https://openalex.org/W2113934189","https://openalex.org/W1586515950","https://openalex.org/W1560792291"],"abstract_inverted_index":{"The":[0],"channel":[1],"assignment":[2,19,85],"problem":[3,15],"is":[4,54],"a":[5,9],"special":[6],"case":[7],"of":[8,47],"very":[10],"well":[11],"studied":[12],"combinatorial":[13],"optimization":[14],"known":[16],"as":[17],"the":[18,33,44,48,70,82],"problem.":[20,37,86],"In":[21],"this":[22],"paper":[23],"we":[24],"introduce":[25],"an":[26],"asymptotically":[27,78],"optimal":[28,79],"fully":[29],"distributed":[30],"algorithm":[31,49,72],"for":[32,81],"maximum":[34],"cardinality":[35],"matching":[36],"We":[38,66],"show":[39,68],"that":[40,69],"with":[41],"high":[42],"probability,":[43],"running":[45],"time":[46],"on":[50],"random":[51],"bipartite":[52],"graphs":[53],"less":[55],"than":[56],"O":[57],"(N":[58],"log(N)/log":[59],"N":[60],"p":[63],"))":[64],".":[65],"then":[67],"proposed":[71],"can":[73],"be":[74],"used":[75],"to":[76],"produce":[77],"solutions":[80],"max":[83],"sum":[84]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2081149067","counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2024-12-17T07:23:17.766900","created_date":"2016-06-24"}