{"id":"https://openalex.org/W2019170215","doi":"https://doi.org/10.1080/00207169508804431","title":"Randomized algorithms for the on-line minimum matching problem on euclidean space","display_name":"Randomized algorithms for the on-line minimum matching problem on euclidean space","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2019170215","doi":"https://doi.org/10.1080/00207169508804431","mag":"2019170215"},"language":"en","primary_location":{"id":"doi:10.1080/00207169508804431","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804431","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5014029657","display_name":"Ying Teh Tsai","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Ying Teh Tsai","raw_affiliation_strings":["Department of Computer Science , National Tsing Hua University , Hsinchu, Taiwan, 300,  Republic of China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , National Tsing Hua University , Hsinchu, Taiwan, 300,  Republic of China","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101474162","display_name":"Chuan Yi Tang","orcid":"https://orcid.org/0000-0003-0729-1624"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chuan Yi Tang","raw_affiliation_strings":["Department of Computer Science , National Tsing Hua University , Hsinchu, Taiwan, 300,  Republic of China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , National Tsing Hua University , Hsinchu, Taiwan, 300,  Republic of China","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065756122","display_name":"Yunn Yen Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yunn Yen Chen","raw_affiliation_strings":["Department of Computer Science , National Tsing Hua University , Hsinchu, Taiwan, 300,  Republic of China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , National Tsing Hua University , Hsinchu, Taiwan, 300,  Republic of China","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5014029657"],"corresponding_institution_ids":["https://openalex.org/I25846049"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17999079,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"58","issue":"1-2","first_page":"19","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.9954000115394592,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7546906471252441},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7167166471481323},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7126932740211487},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6781665086746216},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5717355608940125},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5110396146774292},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.49523821473121643},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49222198128700256},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49128955602645874},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.487693190574646},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.47966626286506653},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4675891101360321},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4343755543231964},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.43174493312835693},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4238995313644409},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12589356303215027},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06896927952766418},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0615752637386322}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7546906471252441},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7167166471481323},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7126932740211487},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6781665086746216},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5717355608940125},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5110396146774292},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.49523821473121643},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49222198128700256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49128955602645874},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.487693190574646},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.47966626286506653},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4675891101360321},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4343755543231964},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.43174493312835693},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4238995313644409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12589356303215027},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06896927952766418},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0615752637386322},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169508804431","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804431","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W12965819","https://openalex.org/W1528366548","https://openalex.org/W1572978590","https://openalex.org/W1968225281","https://openalex.org/W1969730801","https://openalex.org/W1978382073","https://openalex.org/W1986758236","https://openalex.org/W2009931551","https://openalex.org/W2026364494","https://openalex.org/W2029868443","https://openalex.org/W2041645394","https://openalex.org/W2048628062","https://openalex.org/W2067058623","https://openalex.org/W2078625629","https://openalex.org/W2146104665","https://openalex.org/W2151490828","https://openalex.org/W3151613554"],"related_works":["https://openalex.org/W2372768926","https://openalex.org/W1725047827","https://openalex.org/W2898972642","https://openalex.org/W2538786106","https://openalex.org/W2015661530","https://openalex.org/W2104473411","https://openalex.org/W2019170215","https://openalex.org/W2349441126","https://openalex.org/W2057656719","https://openalex.org/W2963651260"],"abstract_inverted_index":{"Suppose":[0],"we":[1,58,95,135,218,238],"are":[2,59,83,114],"given":[3],"two":[4],"sets":[5],"R":[6,74],"and":[7,177,186],"B,":[8],"each":[9,194],"of":[10,19,27,80,91,106,129,142,266],"n":[11,234],"points":[12,79,172,189],"in":[13,30,61,159,173,201],"the":[14,17,24,28,31,49,62,72,78,103,107,127,130,160,174,179,183,187,191,197,208,246,263,267],"plane.":[15],"Define":[16],"cost":[18,51,128,248,265],"a":[20,43,89,140,157,225],"matching":[21,35,46,65,119,133],"to":[22,41,100,125,190,207],"be":[23,110],"toal":[25],"distance":[26],"edges":[29],"matching.":[32,192,271],"The":[33,116],"minimum":[34,50,64,118,180,270],"problem":[36,66,120],"on":[37,52,67,121],"Euclidean":[38,53,68,122,269],"space":[39,123],"is":[40,75,205,223,244,258],"find":[42],"complete":[44,131],"bipartite":[45,132],"which":[47,204],"has":[48],"space.":[54,69],"In":[55,193,215],"this":[56,154,213,216],"paper,":[57,217],"interested":[60],"on-line":[63,117,227],"We":[70],"assume":[71],"set":[73,81,92,161,175],"known,":[76],"but":[77],"B":[82,93,162],"revealed":[84],"one":[85],"by":[86,250,260],"one.":[87],"When":[88,156],"point":[90,158,185],"arrives,":[94,163],"must":[96],"decide":[97],"what":[98],"match":[99],"make":[101],"involving":[102],"point.":[104],"None":[105],"matches":[108],"can":[109],"changed":[111],"after":[112],"they":[113],"made.":[115],"tries":[124],"minimize":[126],"that":[134,220,241],"find.":[136],"This":[137],"paper":[138],"proposes":[139],"family":[141],"randomized":[143],"algorithms,":[144],"Algorithm":[145,164,221,251],"RM(m)":[146,165,222,252],"(1":[147,253],"\ue425":[148,150,231,233,254,256],"m":[149,170,232,255],"n),":[151],"for":[152,212,229],"solving":[153],"problem.":[155,214],"randomly":[166],"chooses":[167],"at":[168],"most":[169],"unmatched":[171],"R,":[176],"adds":[178],"edge":[181],"between":[182],"arriving":[184],"chosen":[188],"decision":[195],"step,":[196],"algorithm":[198,228],"only":[199],"runs":[200],"O(m)":[202],"time,":[203],"superior":[206],"known":[209],"non-randomized":[210],"algorithms":[211],"show":[219,240],"not":[224],"competitive":[226],"1":[230],"\u2212":[235],"1.":[236],"However,":[237],"further":[239],"if":[242],"2n":[243],"large,":[245],"average":[247,264],"incurred":[249],"n)":[257],"bounded":[259],"0(\u221an)":[261],"times":[262],"optimal":[268]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}