{"id":"https://openalex.org/W2342411541","doi":"https://doi.org/10.1109/tkde.2016.2527003","title":"Conflict-Aware Weighted Bipartite B-Matching and Its Application to E-Commerce","display_name":"Conflict-Aware Weighted Bipartite B-Matching and Its Application to E-Commerce","publication_year":2016,"publication_date":"2016-02-08","ids":{"openalex":"https://openalex.org/W2342411541","doi":"https://doi.org/10.1109/tkde.2016.2527003","mag":"2342411541"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2016.2527003","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2016.2527003","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-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/A5100748376","display_name":"Chen Cheng","orcid":"https://orcid.org/0000-0001-5191-2809"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Cheng Chen","raw_affiliation_strings":["Computer Science Department, University of Victoria, Victoria, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Victoria, Victoria, BC, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101031271","display_name":"Lantian Zheng","orcid":"https://orcid.org/0009-0000-0192-4780"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Lan Zheng","raw_affiliation_strings":["Computer Science Department, University of Victoria, Victoria, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Victoria, Victoria, BC, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101961455","display_name":"Venkatesh Srinivasan","orcid":"https://orcid.org/0000-0003-3819-3998"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Venkatesh Srinivasan","raw_affiliation_strings":["Computer Science Department, University of Victoria, Victoria, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Victoria, Victoria, BC, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011013528","display_name":"Alex Thomo","orcid":"https://orcid.org/0000-0002-3020-2258"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Alex Thomo","raw_affiliation_strings":["Computer Science Department, University of Victoria, Victoria, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Victoria, Victoria, BC, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100641549","display_name":"Kui Wu","orcid":"https://orcid.org/0000-0002-2069-0032"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kui Wu","raw_affiliation_strings":["Computer Science Department, University of Victoria, Victoria, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Victoria, Victoria, BC, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001925448","display_name":"Anthony Sukow","orcid":null},"institutions":[{"id":"https://openalex.org/I4210088645","display_name":"Indonesian Coral Reef Foundation","ror":"https://ror.org/004fb1r50","country_code":"ID","type":"nonprofit","lineage":["https://openalex.org/I4210088645"]}],"countries":["ID"],"is_corresponding":false,"raw_author_name":"Anthony Sukow","raw_affiliation_strings":["Terapeak"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Terapeak","institution_ids":["https://openalex.org/I4210088645"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3997,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.92972448,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"28","issue":"6","first_page":"1475","last_page":"1488"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9939000010490417,"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/T11182","display_name":"Auction Theory and Applications","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7932739853858948},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7658477425575256},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6383389234542847},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6021276116371155},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4757482707500458},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.4729464054107666},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44021308422088623},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4387741684913635},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.43469423055648804},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4327913522720337},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4047236442565918},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3427605926990509},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.338672399520874},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3217935562133789},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24076345562934875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18730595707893372},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.17684200406074524},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.174369215965271},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.11683356761932373}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7932739853858948},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7658477425575256},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6383389234542847},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6021276116371155},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4757482707500458},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.4729464054107666},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44021308422088623},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4387741684913635},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.43469423055648804},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4327913522720337},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4047236442565918},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3427605926990509},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.338672399520874},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3217935562133789},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24076345562934875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18730595707893372},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.17684200406074524},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.174369215965271},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.11683356761932373},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tkde.2016.2527003","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2016.2527003","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":84,"referenced_works":["https://openalex.org/W88783017","https://openalex.org/W272710231","https://openalex.org/W619662171","https://openalex.org/W1528845765","https://openalex.org/W1552347772","https://openalex.org/W1557598286","https://openalex.org/W1574410118","https://openalex.org/W1578891227","https://openalex.org/W1601764037","https://openalex.org/W1659045240","https://openalex.org/W1828805609","https://openalex.org/W1862966467","https://openalex.org/W1963547452","https://openalex.org/W1964730816","https://openalex.org/W1975573070","https://openalex.org/W1981213470","https://openalex.org/W1985123706","https://openalex.org/W1992649763","https://openalex.org/W1995176813","https://openalex.org/W1999913571","https://openalex.org/W2005653178","https://openalex.org/W2006709395","https://openalex.org/W2007421997","https://openalex.org/W2008886893","https://openalex.org/W2010127467","https://openalex.org/W2011730242","https://openalex.org/W2012065738","https://openalex.org/W2016081253","https://openalex.org/W2032717442","https://openalex.org/W2034464625","https://openalex.org/W2041645394","https://openalex.org/W2046805788","https://openalex.org/W2047220011","https://openalex.org/W2048837158","https://openalex.org/W2054075345","https://openalex.org/W2055107305","https://openalex.org/W2057869046","https://openalex.org/W2066459185","https://openalex.org/W2072200256","https://openalex.org/W2080197990","https://openalex.org/W2084809122","https://openalex.org/W2085938855","https://openalex.org/W2097826433","https://openalex.org/W2100235918","https://openalex.org/W2106387257","https://openalex.org/W2110171203","https://openalex.org/W2115852343","https://openalex.org/W2116440993","https://openalex.org/W2126380843","https://openalex.org/W2126793736","https://openalex.org/W2131951207","https://openalex.org/W2141923507","https://openalex.org/W2149443616","https://openalex.org/W2149580580","https://openalex.org/W2151125933","https://openalex.org/W2153578526","https://openalex.org/W2157529519","https://openalex.org/W2158268067","https://openalex.org/W2162656786","https://openalex.org/W2164232018","https://openalex.org/W2165949563","https://openalex.org/W2168975651","https://openalex.org/W2183531780","https://openalex.org/W2330424826","https://openalex.org/W2405784120","https://openalex.org/W2417969024","https://openalex.org/W2432517183","https://openalex.org/W3122305203","https://openalex.org/W3144982767","https://openalex.org/W4247154108","https://openalex.org/W4249267926","https://openalex.org/W4250340495","https://openalex.org/W4285719527","https://openalex.org/W4301808069","https://openalex.org/W6631513056","https://openalex.org/W6633264939","https://openalex.org/W6634627752","https://openalex.org/W6639183916","https://openalex.org/W6653197670","https://openalex.org/W6675716505","https://openalex.org/W6682133305","https://openalex.org/W6684173853","https://openalex.org/W6713215065","https://openalex.org/W6717191754"],"related_works":["https://openalex.org/W1725047827","https://openalex.org/W4320022211","https://openalex.org/W1518546215","https://openalex.org/W2147115438","https://openalex.org/W2059407128","https://openalex.org/W2151412766","https://openalex.org/W4383473090","https://openalex.org/W1998998849","https://openalex.org/W2028468530","https://openalex.org/W4308168130"],"abstract_inverted_index":{"The":[0],"weighted":[1],"bipartite":[2,57],"b-matching":[3],"problem":[4],"(WBM)":[5],"plays":[6],"a":[7,39,83,151,159,171],"significant":[8],"role":[9],"in":[10,69,76,88,117],"many":[11],"real-world":[12,173],"applications,":[13],"including":[14],"resource":[15],"allocation,":[16],"scheduling,":[17],"Internet":[18],"advertising,":[19],"and":[20,27,105,128,134,164],"E-commerce.":[21],"WBM":[22,46,113],"has":[23],"been":[24],"widely":[25],"studied":[26],"efficient":[28],"matching":[29,78,95],"algorithms":[30,130],"are":[31,51,68,97],"well":[32],"known.":[33],"In":[34,59],"this":[35],"work,":[36],"we":[37,119],"study":[38],"novel":[40],"variant":[41],"of":[42,55,86,91,102,109,158],"WBM,":[43],"called":[44],"conflict-aware":[45],"(CA-WBM),":[47],"where":[48,93],"conflict":[49],"constraints":[50],"present":[52,82],"between":[53],"vertices":[54,63],"the":[56,65,77,89,155],"graph.":[58],"CA-WBM,":[60],"if":[61],"two":[62],"(on":[64],"same":[66],"side)":[67],"conflict,":[70],"they":[71,137],"may":[72],"not":[73],"be":[74],"included":[75],"result":[79],"simultaneously.":[80],"We":[81,125,149],"generalized":[84],"formulation":[85],"CA-WBM":[87,122,133,163],"context":[90],"E-commerce,":[92],"diverse":[94],"results":[96],"often":[98],"desired":[99],"(e.g.,":[100],"movies":[101],"different":[103,110],"genres":[104],"merchants":[106],"selling":[107],"products":[108],"categories).":[111],"While":[112],"is":[114,123,168],"efficiently":[115],"solvable":[116],"polynomial-time,":[118],"show":[120,135,165],"that":[121,136,166],"NP-hard.":[124],"propose":[126],"approximate":[127],"randomized":[129],"to":[131,140],"solve":[132],"achieve":[138],"close":[139],"optimal":[141],"solutions":[142],"via":[143],"comprehensive":[144],"experiments":[145],"using":[146],"synthetic":[147],"datasets.":[148],"derive":[150],"theoretical":[152],"bound":[153],"on":[154,170],"approximation":[156],"ratio":[157],"greedy":[160],"algorithm":[161],"for":[162],"it":[167],"scalable":[169],"large-scale":[172],"dataset.":[174]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}