{"id":"https://openalex.org/W1736880087","doi":"https://doi.org/10.1007/11940128_17","title":"Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems","display_name":"Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1736880087","doi":"https://doi.org/10.1007/11940128_17","mag":"1736880087"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/11940128_17","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/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"book-chapter","type_crossref":"book-chapter","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/A5062523877","display_name":"Telikepalli Kavitha","orcid":"https://orcid.org/0000-0003-2619-6606"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Telikepalli Kavitha","raw_affiliation_strings":["Indian Institute of Science, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science, Bangalore, India","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047282260","display_name":"Chintan D. Shah","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Chintan D. Shah","raw_affiliation_strings":["Indian Institute of Science, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science, Bangalore, India","institution_ids":["https://openalex.org/I59270414"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392,"provenance":"doaj"},"apc_paid":null,"fwci":2.326,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":29,"citation_normalized_percentile":{"value":0.939102,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":90},"biblio":{"volume":null,"issue":null,"first_page":"153","last_page":"162"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Combinatorial Optimization and Complexity Theory","score":0.9991,"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":"Combinatorial Optimization and Complexity Theory","score":0.9991,"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":"Graph Theory and Algorithms","score":0.9951,"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":"Distributed Coordination in Online Robotics Research","score":0.9934,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/gathering-algorithms","display_name":"Gathering Algorithms","score":0.568382},{"id":"https://openalex.org/keywords/stochastic-matching","display_name":"Stochastic Matching","score":0.56054},{"id":"https://openalex.org/keywords/fixed-parameter-algorithms","display_name":"Fixed-Parameter Algorithms","score":0.553093},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized Complexity","score":0.552863},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"Approximation Algorithms","score":0.551076},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.5433697},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.47697553}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8517307},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7483467},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5724018},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5469688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5455328},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.5433697},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.47697553},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42433116},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3805865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35426182},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/11940128_17","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/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"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":14,"referenced_works":["https://openalex.org/W1494735819","https://openalex.org/W1530187336","https://openalex.org/W15553240","https://openalex.org/W1973230403","https://openalex.org/W1984726588","https://openalex.org/W2002710354","https://openalex.org/W2005263243","https://openalex.org/W2008751404","https://openalex.org/W2076154639","https://openalex.org/W2084375356","https://openalex.org/W2157529519","https://openalex.org/W2294970663","https://openalex.org/W2570869557","https://openalex.org/W4237854149"],"related_works":["https://openalex.org/W4320022211","https://openalex.org/W4300815962","https://openalex.org/W4299556280","https://openalex.org/W4297197852","https://openalex.org/W2951991516","https://openalex.org/W2892253014","https://openalex.org/W2607035390","https://openalex.org/W2381564394","https://openalex.org/W1725047827","https://openalex.org/W1518546215"],"abstract_inverted_index":{"We":[0,67,125,165],"consider":[1,69,127,167],"the":[2,26,70,79,90,97,102,120,128,154,174],"problem":[3,82],"of":[4,25,46,92,99,122,157,170],"designing":[5],"efficient":[6],"algorithms":[7],"for":[8,113,139],"computing":[9],"certain":[10],"matchings":[11],"in":[12,62,85,101,137,161,181],"a":[13,23,44,57,163,168],"bipartite":[14],"graph":[15],"$G":[16],"=({\\mathcal{A}}":[17],"\\cup":[18],"{\\mathcal{P}},":[19],"{\\mathcal{E}})$":[20],",":[21],"with":[22],"partition":[24],"edge":[27,159],"set":[28,45],"as":[29],"${\\mathcal{E}}":[30],"=":[31],"{\\mathcal{E}}_1":[32],"{\\mathbin":[33,37],"{\\dot{\\cup}}}":[34,38],"{\\mathcal{E}}_2":[35],"\\ldots":[36],"{\\mathcal{E}}_r$":[39],".":[40],"A":[41],"matching":[42,72,81,130,177],"is":[43,89,96,119,153],"(a,":[47],"p)":[48],"pairs,":[49],"$a":[50],"\\in":[51],"{\\mathcal{A}},":[52],"p\\in{\\mathcal{P}}$":[53],"such":[54,162],"that":[55],"each":[56,59],"and":[58,94],"p":[60],"appears":[61],"at":[63],"most":[64],"one":[65],"pair.":[66],"first":[68],"popular":[71,80],"problem;":[73,131],"an":[74,107,132,145,158],"$O(m\\sqrt{n})$":[75],"algorithm":[76,112,134],"to":[77],"solve":[78],"was":[83,135],"given":[84,136],"[3],":[86],"where":[87,116,151,179],"n":[88],"number":[91,98],"vertices":[93,180],"m":[95],"edges":[100],"graph.":[103],"Here":[104,142],"we":[105,143],"present":[106],"O(n":[108],"\u03c9":[109,147],")":[110,148],"randomized":[111,149],"this":[114,140,171],"problem,":[115,172,178],"\u03c9<":[117],"2.376":[118],"exponent":[121],"matrix":[123],"multiplication.":[124],"next":[126],"rank-maximal":[129,176],"$O(\\min(mn,Cm\\sqrt{n}))$":[133],"[7]":[138],"problem.":[141],"give":[144],"O(Cn":[146],"algorithm,":[150],"C":[152],"largest":[155],"rank":[156],"used":[160],"matching.":[164],"also":[166],"generalization":[169],"called":[173],"weighted":[175],"${\\mathcal{A}}$":[182],"have":[183],"positive":[184],"weights.":[185]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1736880087","counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2024-11-30T00:58:35.771612","created_date":"2016-06-24"}