{"id":"https://openalex.org/W1996574030","doi":"https://doi.org/10.1137/s0097539797322255","title":"An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications","display_name":"An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1996574030","doi":"https://doi.org/10.1137/s0097539797322255","mag":"1996574030"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539797322255","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797322255","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/A5074983702","display_name":"Xin He","orcid":"https://orcid.org/0000-0002-3904-0478"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xin He","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101483230","display_name":"Zhi\u2010Zhong Chen","orcid":"https://orcid.org/0000-0003-3061-1171"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhi-Zhong Chen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074983702"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20992984,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"1","first_page":"65","last_page":"80"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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":"Advanced Graph Theory Research","score":0.9983999729156494,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9840999841690063,"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/combinatorics","display_name":"Combinatorics","score":0.7973198890686035},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.716267466545105},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6846425533294678},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5430845618247986},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5129232406616211},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.4836755692958832},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.42350250482559204},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.4228004217147827},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4148937463760376},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37358877062797546},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.309994101524353},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2931026816368103}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7973198890686035},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.716267466545105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6846425533294678},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5430845618247986},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5129232406616211},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.4836755692958832},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.42350250482559204},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.4228004217147827},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4148937463760376},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37358877062797546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.309994101524353},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2931026816368103},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539797322255","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797322255","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":13,"referenced_works":["https://openalex.org/W80909727","https://openalex.org/W1966793805","https://openalex.org/W2009319645","https://openalex.org/W2016871180","https://openalex.org/W2033751470","https://openalex.org/W2055257826","https://openalex.org/W2057640376","https://openalex.org/W2082378428","https://openalex.org/W2087817903","https://openalex.org/W2116078914","https://openalex.org/W2138356285","https://openalex.org/W2152978478","https://openalex.org/W2165968314"],"related_works":["https://openalex.org/W2038088825","https://openalex.org/W1975203667","https://openalex.org/W2370328482","https://openalex.org/W99690574","https://openalex.org/W2790788195","https://openalex.org/W2962785705","https://openalex.org/W2000334112","https://openalex.org/W2121104987","https://openalex.org/W4293584096","https://openalex.org/W4286247391"],"abstract_inverted_index":{"The":[0],"traveling":[1],"salesman":[2],"problem":[3,14,147,215],"on":[4,18],"an":[5,110],"n-point":[6],"convex":[7],"polygon":[8],"and":[9,29,65,74,125,175,187,192,202,220],"the":[10,34,106,136,171,195,198,213],"minimum":[11],"latency":[12],"tour":[13],"for":[15,183],"n":[16],"points":[17],"a":[19,217],"straight":[20],"line":[21],"are":[22,179,194],"two":[23],"basic":[24],"problems":[25,42,93],"in":[26,33,46,56,97,143,153,163,205,210],"graph":[27],"theory":[28],"have":[30],"been":[31],"studied":[32],"past.":[35],"Previously,":[36],"it":[37,159,224],"was":[38,60],"known":[39],"that":[40,91,158,223],"both":[41,92,180],"can":[43,53,94,160,225],"be":[44,54,95,161,226],"solved":[45,55,96,162],"O(n2":[47],")":[48,58],"time.":[49],"However,":[50],"whether":[51],"they":[52],"o(n2":[57],"time":[59,101,150,169],"left":[61],"open":[62],"by":[63,102],"Marcotte":[64],"Suri":[66],"[SIAM":[67],"J.":[68],"Comput.,":[69],"20":[70,81],"(1991),":[71],"pp.":[72,83],"405--422]":[73],"Afrati":[75],"et":[76],"al.":[77],"[Informatique":[78],"Theorique":[79],"Appl.,":[80],"(1986),":[82],"79--87],":[84],"respectively.":[85,207],"In":[86],"this":[87,211],"paper":[88],"we":[89,132,156,221],"show":[90,157],"O(n":[98,164],"log":[99,167],"n)":[100,168],"reducing":[103],"them":[104],"to":[105,134,141,151,228],"following":[107],"problem:":[108],"Given":[109],"edge-weighted":[111],"complete":[112],"bipartite":[113],"digraph":[114],"G=(X,":[115],"Y,":[116],"E)":[117],"with":[118],"X={x0":[119],",":[120,127],".":[121,122,128,129],".,":[123,130],"xn}":[124],"Y={y0":[126],"ym},":[131],"wish":[133],"find":[135],"shortest":[137],"path":[138],"from":[139],"x0":[140],"xn":[142],"G.":[144],"This":[145],"new":[146,214],"requires":[148],"$\\Omega(nm)$":[149],"solve":[152,229],"general,":[154],"but":[155],"+":[165],"m":[166],"if":[170],"weight":[172],"matrices":[173],"A":[174],"B":[176],"of":[177,197],"G":[178],"concave,":[181],"where":[182],"$0\\leq":[184,188],"i\\leq":[185],"n$":[186],"j\\leq":[189],"m$,":[190],"A[i,j]":[191],"B[j,i]":[193],"weights":[196],"edges":[199],"(xi,":[200],"yj)":[201],"(yj,":[203],"xi)":[204],"G,":[206],"As":[208],"demonstrated":[209],"paper,":[212],"is":[216],"powerful":[218],"tool":[219],"believe":[222],"used":[227],"more":[230],"problems.":[231]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}