{"id":"https://openalex.org/W2047430913","doi":"https://doi.org/10.1137/s0097539794267243","title":"Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours","display_name":"Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours","publication_year":1998,"publication_date":"1998-02-01","ids":{"openalex":"https://openalex.org/W2047430913","doi":"https://doi.org/10.1137/s0097539794267243","mag":"2047430913"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794267243","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794267243","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5103600441","display_name":"Samuel R. Buss","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Samuel R. Buss","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072630705","display_name":"P.N. Yianilos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter N. Yianilos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.517,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.82446715,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"27","issue":"1","first_page":"170","last_page":"201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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":"Optimization and Search Problems","score":0.9987000226974487,"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.9976999759674072,"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/bipartite-graph","display_name":"Bipartite graph","score":0.8173970580101013},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8072959184646606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7103049755096436},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5851481556892395},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5215487480163574},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.48939624428749084},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.48073410987854004},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.42638736963272095},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40465953946113586},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40326571464538574},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33357933163642883},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08308833837509155}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8173970580101013},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8072959184646606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7103049755096436},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5851481556892395},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5215487480163574},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.48939624428749084},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.48073410987854004},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.42638736963272095},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40465953946113586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40326571464538574},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33357933163642883},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08308833837509155},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539794267243","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794267243","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1501400124","https://openalex.org/W1994172977","https://openalex.org/W2000080814","https://openalex.org/W2005897481","https://openalex.org/W2007052372","https://openalex.org/W2015784096","https://openalex.org/W2016871180","https://openalex.org/W2033751470","https://openalex.org/W2044060832","https://openalex.org/W2046569320","https://openalex.org/W2055257826","https://openalex.org/W2057640376","https://openalex.org/W2074803434","https://openalex.org/W2082378428","https://openalex.org/W2087817903","https://openalex.org/W2134937101","https://openalex.org/W2138356285","https://openalex.org/W2152978478","https://openalex.org/W3138958529"],"related_works":["https://openalex.org/W2567825307","https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2945016732","https://openalex.org/W2785998768","https://openalex.org/W2371352078","https://openalex.org/W2362975861","https://openalex.org/W2054458431","https://openalex.org/W2804963084","https://openalex.org/W2151412766"],"abstract_inverted_index":{"Let":[0],"G":[1,25],"be":[2,247,361],"a":[3,43,78,105,176,215,268,312],"complete,":[4],"weighted,":[5],"undirected,":[6],"bipartite":[7,64],"graph":[8,101],"with":[9,142,272,298,314],"n":[10,123],"red":[11,32,362],"nodes,":[12,15],"n\"":[13,125],"blue":[14,36,366],"and":[16,80,127,149,234,277,320,363,367,386],"symmetric":[17],"cost":[18],"function":[19,283],"c(x,y).":[20],"A":[21],"maximum":[22,45],"matching":[23,65,178,331],"for":[24,49,84,129,328,394],"consists":[26],"of":[27,53,89,99,146,151,188,236,248,284],"$\\min\\{n,n^\\prime\\}$":[28],"edges":[29],"from":[30],"distinct":[31,35,396],"nodes":[33,98,290],"to":[34,41,196,232,308,360,371,408,422,429],"nodes.":[37],"Our":[38,92,226],"objective":[39],"is":[40,61,70,95,194,204,214,228,406,431],"find":[42,420],"minimum-cost":[44,177,330],"matching,":[46],"i.e.,":[47],"one":[48,147,359,393],"which":[50,265,425],"the":[51,54,62,73,97,100,152,155,191,207,211,259,273,324,329,343,353,364,378,383],"sum":[52],"edge":[55],"costs":[56,278,299,315,339],"has":[57],"minimal":[58],"value.":[59],"This":[60,108],"weighted":[63],"problem":[66,253,332],"or,":[67],"as":[68,104,116],"it":[69,245,405],"sometimes":[71],"called,":[72],"assignment":[74,389],"problem.":[75,91],"We":[76],"report":[77],"new":[79],"very":[81],"fast":[82],"algorithm":[83,173,227,327],"an":[85,185,293],"abstract":[86],"special":[87,208],"case":[88,209],"this":[90,334,376],"first":[93,325],"requirement":[94],"that":[96,110,128,244,410],"are":[102,112,340,380,391,402,413],"given":[103,279,316,341],"\"quasi-convex":[106],"tour.\"":[107],"means":[109],"they":[111],"provided":[113,300],"circularly":[114],"ordered":[115],"x1":[117],",...,xN":[118],",":[119,126,144],"where":[120,210,338],"N":[121],"=":[122,170],"+":[124,161,165],"any":[130,281],"$x_i,":[131],"x_j,":[132],"x_k,":[133],"x_\\ell$,":[134],"not":[135],"necessarily":[136],"adjacent":[137],"but":[138],"in":[139,179,251,333,382,424],"tour":[140,275],"order,":[141],"xi":[143],"xj":[145],"color":[148],"$x_k,x_\\ell$":[150],"opposite":[153],"color,":[154],"following":[156],"inequality":[157],"holds:":[158],"\\[":[159],"c(x_i,x_\\ell)":[160],"c(x_j,x_k)":[162],"\\le":[163],"c(x_i,x_k)":[164],"c(x_j,x_\\ell).":[166],"\\]":[167],"If":[168],"$n":[169,223],"n^\\prime$,":[171],"our":[172,369,411,417],"then":[174],"finds":[175],"$O(N":[180],"\\log":[181],"N)$":[182],"time.":[183],"Given":[184,348],"additional":[186],"condition":[187,306],"``weak":[189],"analyticity,\"":[190],"time":[192],"complexity":[193],"reduced":[195],"$O(N)$.":[197],"In":[198,206,375],"both":[199],"cases":[200],"only":[201],"linear":[202],"space":[203],"required.":[205],"circular":[212],"ordering":[213],"line-like":[216],"ordering,":[217,276],"these":[218,400],"results":[219],"apply":[220],"even":[221],"if":[222],"\\ne":[224],"n^\\prime$.":[225],"conceptually":[229],"elegant,":[230],"straightforward":[231],"implement,":[233],"free":[235],"large":[237],"hidden":[238],"constants.":[239],"As":[240],"such":[241],"we":[242,321,356],"expect":[243],"may":[246,357,419],"practical":[249],"value":[250],"several":[252],"areas.":[254],"Many":[255],"natural":[256],"graphs":[257,264,288],"satisfy":[258],"quasi-convexity":[260],"condition.":[261],"These":[262],"include":[263],"lie":[266,291],"on":[267,292,311],"line":[269,385],"or":[270,287,345],"circle":[271,313],"canonical":[274],"by":[280,301,317,342],"concave-down":[282],"arclength":[285],"---":[286],"whose":[289],"arbitrary":[294],"convex":[295],"planar":[296],"figure":[297],"Euclidean":[302,318],"distance.":[303],"The":[304],"weak-analyticity":[305],"applies":[307],"points":[309],"lying":[310],"distance,":[319],"thus":[322],"obtain":[323],"linear-time":[326],"setting":[335],"(and":[336],"also":[337],"$L_1$":[344],"$L_\\infty$":[346],"metrics).":[347],"two":[349],"symbol":[350],"strings":[351,379],"over":[352],"same":[354],"alphabet,":[355],"imagine":[358],"other":[365],"use":[368],"algorithms":[370,418],"compute":[372],"string":[373],"distances.":[374],"formulation,":[377],"embedded":[381],"real":[384],"multiple":[387],"independent":[388],"problems":[390,423],"solved,":[392],"each":[395],"alphabet":[397],"symbol.":[398],"While":[399],"examples":[401],"somewhat":[403],"geometrical,":[404],"important":[407],"remember":[409],"conditions":[412],"purely":[414],"abstract;":[415],"hence,":[416],"application":[421],"no":[426],"direct":[427],"connection":[428],"geometry":[430],"evident.":[432]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}