{"id":"https://openalex.org/W7084396270","doi":"https://doi.org/10.1007/s00224-025-10230-1","title":"Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line","display_name":"Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line","publication_year":2025,"publication_date":"2025-07-08","ids":{"openalex":"https://openalex.org/W7084396270","doi":"https://doi.org/10.1007/s00224-025-10230-1"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-025-10230-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-025-10230-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10230-1.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10230-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Tung-Wei Kuo","orcid":null},"institutions":[{"id":"https://openalex.org/I87354575","display_name":"National Chengchi University","ror":"https://ror.org/03rqk8h36","country_code":"TW","type":"education","lineage":["https://openalex.org/I87354575"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Tung-Wei Kuo","raw_affiliation_strings":["Department of Computer Science, National Chengchi University, No. 64, Sec. 2, Zhinan Rd., Taipei, 11605, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Chengchi University, No. 64, Sec. 2, Zhinan Rd., Taipei, 11605, Taiwan","institution_ids":["https://openalex.org/I87354575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I87354575"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.59163069,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"69","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10252","display_name":"Microbial Natural Products and Biosynthesis","score":0.20550000667572021,"subfield":{"id":"https://openalex.org/subfields/2736","display_name":"Pharmacology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T10252","display_name":"Microbial Natural Products and Biosynthesis","score":0.20550000667572021,"subfield":{"id":"https://openalex.org/subfields/2736","display_name":"Pharmacology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T10120","display_name":"Bacterial Genetics and Biotechnology","score":0.1088000014424324,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.08609999716281891,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.7875000238418579},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.717199981212616},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6396999955177307},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6294000148773193},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6205999851226807},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5943999886512756},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.4706999957561493},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.39660000801086426}],"concepts":[{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.7875000238418579},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.717199981212616},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6396999955177307},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6294000148773193},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6205999851226807},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5943999886512756},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5084999799728394},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4706999957561493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4124000072479248},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.39660000801086426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36390000581741333},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33959999680519104},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3366999924182892},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3276999890804291},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.3264999985694885},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.31200000643730164},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.3084000051021576},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2971000075340271},{"id":"https://openalex.org/C2780898871","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Performance metric","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.2825999855995178},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2660999894142151}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00224-025-10230-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-025-10230-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10230-1.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00224-025-10230-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-025-10230-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10230-1.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320316922","display_name":"National Chengchi University","ror":"https://ror.org/03rqk8h36"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7084396270.pdf","grobid_xml":"https://content.openalex.org/works/W7084396270.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1984735486","https://openalex.org/W2114538202","https://openalex.org/W2295274877","https://openalex.org/W2572141964","https://openalex.org/W2750046462","https://openalex.org/W2768304016","https://openalex.org/W2783336934","https://openalex.org/W2807287186","https://openalex.org/W2883104186","https://openalex.org/W2893807579","https://openalex.org/W2922865928","https://openalex.org/W2962687396","https://openalex.org/W2963074526","https://openalex.org/W2963149936","https://openalex.org/W2963621431","https://openalex.org/W2972177954","https://openalex.org/W3020987299","https://openalex.org/W3030774092","https://openalex.org/W3081862881","https://openalex.org/W3115562732","https://openalex.org/W3126483964","https://openalex.org/W4205760490","https://openalex.org/W4221165155","https://openalex.org/W4237102200","https://openalex.org/W4247154108","https://openalex.org/W4316652250","https://openalex.org/W4376639583","https://openalex.org/W4390578024","https://openalex.org/W4390591100","https://openalex.org/W4404734132","https://openalex.org/W4407259349"],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,29,37,45,72,75,79,132,139,147,161,170,189,195,200,208,226],"online":[3,25],"minimum":[4,171,210,237],"cost":[5,172],"bipartite":[6,173],"perfect":[7,174],"matching":[8,30,175,227],"with":[9],"delays":[10],"problem.":[11,176],"In":[12,126,177,221],"this":[13,127,178],"problem,":[14,179],"$$\\varvec{m}$$":[15,18],"servers":[16,32,52,142,186],"and":[17,23,33,48,53,87,117,136,143,184],"requests":[19,34,54,144],"arrive":[20,187],"over":[21],"time,":[22],"an":[24],"algorithm":[26,101,157,165,197],"can":[27],"delay":[28,38,49,180,225],"between":[31],"by":[35,167,241],"paying":[36],"cost.":[39,50],"The":[40],"objective":[41],"is":[42,62,71,82,111,158,181,218],"to":[43,202],"minimize":[44],"total":[46],"distance":[47],"When":[51,78,191],"lie":[55],"in":[56,188],"a":[57,63,84,90,151,192,203,219,229],"known":[58],"metric":[59,76,80],"space,":[60],"there":[61],"randomized":[64],"$$\\varvec{O(\\log":[65],"n)}$$":[66],"-competitive":[67,100,154],"algorithm,":[68,223],"where":[69,141,215],"$$\\varvec{n}$$":[70],"size":[73],"of":[74,134,228],"space.":[77],"space":[81],"unknown":[83],"priori,":[85],"Azar":[86,135],"Jacob-Fanani":[88,137],"proposed":[89,166],"deterministic":[91,152],"$$\\varvec{O\\left(":[92],"\\frac{1}{\\epsilon":[93],"}m^{\\log":[94],"\\left(":[95],"\\frac{3+\\epsilon":[96],"}{2}\\right)":[97],"}\\right)":[98],"}$$":[99,124],"for":[102,120,138,169],"any":[103],"fixed":[104],"$$\\varvec{\\epsilon>":[105],"0}$$":[106],".":[107,125,243],"This":[108],"competitive":[109],"ratio":[110],"tight":[112],"when":[113],"$$\\varvec{n":[114],"=":[115],"1}$$":[116,217],"becomes":[118],"$$\\varvec{O(m^{0.59})}$$":[119],"sufficiently":[121],"small":[122],"$$\\varvec{\\epsilon":[123],"paper,":[128],"we":[129,224],"improve":[130],"upon":[131],"result":[133],"case":[140],"are":[145],"on":[146,160,207],"real":[148],"line,":[149],"providing":[150],"$$\\varvec{\\tilde{O}(m^{0.5})}$$":[153],"algorithm.":[155],"Our":[156],"based":[159,206],"Robust":[162],"Matching":[163],"(RM)":[164],"Raghvendra":[168],"not":[182],"allowed,":[183],"all":[185],"beginning.":[190],"request":[193,201,230],"arrives,":[194],"RM":[196],"immediately":[198],"matches":[199],"free":[204],"server":[205],"request\u2019s":[209],"$$\\varvec{t}$$":[211,238,242],"-net-cost":[212,239],"augmenting":[213],"path,":[214],"$$\\varvec{t>":[216],"constant.":[220],"our":[222],"until":[231],"its":[232,236],"waiting":[233],"time":[234],"exceeds":[235],"divided":[240]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}