{"id":"https://openalex.org/W2160495255","doi":null,"title":"On the shortest path and minimum spanning tree problems","display_name":"On the shortest path and minimum spanning tree problems","alternate_titles":[],"publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2160495255","mag":"2160495255"},"language":"en","primary_location":{"id":"pmh:oai:repositories.lib.utexas.edu:2152/859","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/2152/859","pdf_url":null,"source":{"id":"https://openalex.org/S4306400568","display_name":"Texas ScholarWorks (Texas Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210102904","host_organization_name":"Texas Digital Library","host_organization_lineage":["https://openalex.org/I4210102904"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"parent_works":[],"lineage":["https://openalex.org/W2160495255"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2152/859","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904","observed_orcids":["https://orcid.org/0000-0002-0495-3904"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seth Pettie","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-0495-3904","affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Vijaya Ramachandran","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vijaya Ramachandran","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":null,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.0,"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/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.7630000114440918},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.9369999766349792},{"id":"https://openalex.org/keywords/all-pairs-shortest-paths","display_name":"all-pairs shortest paths","score":0.8399999737739563},{"id":"https://openalex.org/keywords/single-source-shortest-path","display_name":"single-source shortest path","score":0.9769999980926514},{"id":"https://openalex.org/keywords/query-complexity","display_name":"query complexity","score":0.7609999775886536},{"id":"https://openalex.org/keywords/inverse-ackermann-function","display_name":"inverse Ackermann function","score":0.8379999995231628},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.8980000019073486},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.765999972820282},{"id":"https://openalex.org/keywords/erew-pram","display_name":"EREW PRAM","score":0.8489999771118164},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.6690000295639038},{"id":"https://openalex.org/keywords/general-graphs","display_name":"general graphs","score":0.5239999890327454},{"id":"https://openalex.org/keywords/combinatorial-optimization-algorithms","display_name":"combinatorial optimization algorithms","score":0.6140000224113464}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6434962153434753},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6304318904876709},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6084161400794983},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5894858241081238},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5500785112380981},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.5218466520309448},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4894494116306305},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.46504440903663635},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4472264051437378},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.43698617815971375},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43548041582107544},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.42604708671569824},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.31066906452178955},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13389724493026733},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:repositories.lib.utexas.edu:2152/859","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/2152/859","pdf_url":null,"source":{"id":"https://openalex.org/S4306400568","display_name":"Texas ScholarWorks (Texas Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210102904","host_organization_name":"Texas Digital Library","host_organization_lineage":["https://openalex.org/I4210102904"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"mag:2160495255","doi":null,"is_oa":false,"landing_page_url":"https://repositories.lib.utexas.edu/bitstream/2152/859/2/petties036.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.630.990","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.630.990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://repositories.lib.utexas.edu/bitstream/handle/2152/859/petties036.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.644.3997","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.644.3997","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.eecs.umich.edu/~pettie/papers/D.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:repositories.lib.utexas.edu:2152/859","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/2152/859","pdf_url":null,"source":{"id":"https://openalex.org/S4306400568","display_name":"Texas ScholarWorks (Texas Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210102904","host_organization_name":"Texas Digital Library","host_organization_lineage":["https://openalex.org/I4210102904"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2160495255.pdf","grobid_xml":"https://content.openalex.org/works/W2160495255.grobid-xml"},"referenced_works_count":171,"referenced_works":["https://openalex.org/W4796843","https://openalex.org/W10162269","https://openalex.org/W32552433","https://openalex.org/W137816674","https://openalex.org/W219725727","https://openalex.org/W1270205671","https://openalex.org/W1480135873","https://openalex.org/W1489554686","https://openalex.org/W1495932320","https://openalex.org/W1496754705","https://openalex.org/W1496921672","https://openalex.org/W1498660721","https://openalex.org/W1510642760","https://openalex.org/W1513400187","https://openalex.org/W1521225740","https://openalex.org/W1537256577","https://openalex.org/W1550136763","https://openalex.org/W1554802999","https://openalex.org/W1556590257","https://openalex.org/W1559701472","https://openalex.org/W1565148911","https://openalex.org/W1566824445","https://openalex.org/W1566918731","https://openalex.org/W1567047166","https://openalex.org/W1584086289","https://openalex.org/W1592580490","https://openalex.org/W1601227146","https://openalex.org/W1602103078","https://openalex.org/W1705251487","https://openalex.org/W1821591339","https://openalex.org/W1823654214","https://openalex.org/W1869518224","https://openalex.org/W1963503748","https://openalex.org/W1965214876","https://openalex.org/W1965230032","https://openalex.org/W1965525854","https://openalex.org/W1965680834","https://openalex.org/W1968778433","https://openalex.org/W1969148345","https://openalex.org/W1969357318","https://openalex.org/W1969446695","https://openalex.org/W1969668378","https://openalex.org/W1970309382","https://openalex.org/W1973942323","https://openalex.org/W1974807151","https://openalex.org/W1975248037","https://openalex.org/W1975990553","https://openalex.org/W1978099551","https://openalex.org/W1978624651","https://openalex.org/W1978757752","https://openalex.org/W1979867994","https://openalex.org/W1982180670","https://openalex.org/W1982512167","https://openalex.org/W1982842799","https://openalex.org/W1985217658","https://openalex.org/W1985516136","https://openalex.org/W1985882632","https://openalex.org/W1986261983","https://openalex.org/W1989031126","https://openalex.org/W1989640573","https://openalex.org/W1990678352","https://openalex.org/W1991528957","https://openalex.org/W1993269667","https://openalex.org/W1996641400","https://openalex.org/W1998777945","https://openalex.org/W1999545213","https://openalex.org/W1999812064","https://openalex.org/W2004350101","https://openalex.org/W2004779434","https://openalex.org/W2006820476","https://openalex.org/W2011824743","https://openalex.org/W2011999472","https://openalex.org/W2012857639","https://openalex.org/W2017927472","https://openalex.org/W2020810308","https://openalex.org/W2022117185","https://openalex.org/W2022980325","https://openalex.org/W2023658462","https://openalex.org/W2027580688","https://openalex.org/W2028341270","https://openalex.org/W2028503265","https://openalex.org/W2029132631","https://openalex.org/W2030153860","https://openalex.org/W2032841680","https://openalex.org/W2033740214","https://openalex.org/W2035476608","https://openalex.org/W2035693183","https://openalex.org/W2037688351","https://openalex.org/W2038080079","https://openalex.org/W2038161379","https://openalex.org/W2038643780","https://openalex.org/W2039221685","https://openalex.org/W2039757598","https://openalex.org/W2044332144","https://openalex.org/W2045271686","https://openalex.org/W2047976119","https://openalex.org/W2048500523","https://openalex.org/W2048824634","https://openalex.org/W2049500052","https://openalex.org/W2050866845","https://openalex.org/W2053946214","https://openalex.org/W2054329164","https://openalex.org/W2054523876","https://openalex.org/W2056496054","https://openalex.org/W2058426370","https://openalex.org/W2059771614","https://openalex.org/W2060919812","https://openalex.org/W2063844956","https://openalex.org/W2065759448","https://openalex.org/W2068796193","https://openalex.org/W2069001533","https://openalex.org/W2069446854","https://openalex.org/W2069893028","https://openalex.org/W2071346873","https://openalex.org/W2071845176","https://openalex.org/W2075188242","https://openalex.org/W2079849139","https://openalex.org/W2080063509","https://openalex.org/W2084224084","https://openalex.org/W2086825382","https://openalex.org/W2087216833","https://openalex.org/W2089290774","https://openalex.org/W2089620427","https://openalex.org/W2090339428","https://openalex.org/W2090533339","https://openalex.org/W2090747326","https://openalex.org/W2090824272","https://openalex.org/W2091299439","https://openalex.org/W2092423448","https://openalex.org/W2093455937","https://openalex.org/W2098755772","https://openalex.org/W2099463627","https://openalex.org/W2103361121","https://openalex.org/W2105310556","https://openalex.org/W2110824700","https://openalex.org/W2120424341","https://openalex.org/W2124852572","https://openalex.org/W2125182537","https://openalex.org/W2128865241","https://openalex.org/W2133768189","https://openalex.org/W2134490689","https://openalex.org/W2134845011","https://openalex.org/W2135436879","https://openalex.org/W2138304862","https://openalex.org/W2139559590","https://openalex.org/W2151021662","https://openalex.org/W2151440203","https://openalex.org/W2152506249","https://openalex.org/W2155086352","https://openalex.org/W2156372444","https://openalex.org/W2160365857","https://openalex.org/W2164141517","https://openalex.org/W2164485560","https://openalex.org/W2166669959","https://openalex.org/W2167630072","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2462459316","https://openalex.org/W2618199688","https://openalex.org/W2735078909","https://openalex.org/W2762935521","https://openalex.org/W3048286268","https://openalex.org/W3137299218","https://openalex.org/W3139863117","https://openalex.org/W3161781519","https://openalex.org/W3198470706","https://openalex.org/W4240963431","https://openalex.org/W4249333804","https://openalex.org/W4255029477","https://openalex.org/W7029321148","https://openalex.org/W7070665592"],"related_works":["https://openalex.org/W7043204319","https://openalex.org/W2551610296","https://openalex.org/W2111415774","https://openalex.org/W2234830005","https://openalex.org/W7097870536","https://openalex.org/W3021361739","https://openalex.org/W4248396357","https://openalex.org/W2054750642","https://openalex.org/W4251364725","https://openalex.org/W4253435003"],"abstract_inverted_index":{"The":[0,336],"shortest":[1,62,160,200,226,310,327],"path":[2,63,161,201,227,328],"and":[3,23,61,116,177,184,350],"minimum":[4,58,132,147,278,339,365],"spanning":[5,59,133,279,340,366],"tree":[6,60,134,149,341,367],"problems":[7,14,40,76,90],"are":[8,19,49,77,91,102,179,330],"two":[9,248],"of":[10,31,38,46,52,99,109,125,145,182,246,317,325,331,374,388,400],"the":[11,35,57,89,122,142,146,180,188,220,244,276,286,332,356,385],"classic":[12],"\\ntextbook":[13],"in":[15,167,207,230],"combinatorial":[16],"optimization.":[17],"They":[18],"simple":[20,25],"to":[21,73,88,153,347],"describe":[22],"\\nadmit":[24],"polynomial-time":[26],"algorithms.":[27],"However,":[28],"despite":[29],"years":[30],"concerted":[32],"\\nresearch":[33],"effort,":[34],"asymptotic":[36],"complexity":[37,144,387],"these":[39,75],"remains":[41],"unresolved.":[42],"\\nThe":[43],"main":[44],"contributions":[45],"this":[47,256,315],"dissertation":[48],"a":[50,138,293,371,395],"number":[51,181,373],"asymptotically":[53],"\\nfaster":[54],"algorithms":[55,329],"for":[56,163,203,275,292,355],"problems.":[64],"Of":[65],"\\nequal":[66],"interest,":[67],"we":[68,82],"provide":[69],"some":[70],"clues":[71],"as":[72],"why":[74,84],"so":[78],"diffcult.":[79],"In":[80],"\\nparticular,":[81],"show":[83],"certain":[85],"modern":[86],"approaches":[87,192],"doomed":[92],"\\nto":[93],"have":[94],"super-linear":[95],"complexity.":[96],"A":[97,128,224,361],"sampling":[98],"our":[100,110,326],"results":[101],"listed":[103],"below.":[104],"We":[105],"emphasize":[106],"that":[107,141,314,343],"all":[108],"\\nalgorithms":[111],"work":[112],"with":[113],"general":[114,164],"graphs,":[115],"make":[117],"no":[118],"restrictive":[119],"assumptions":[120],"on":[121,194,306,384],"\\nnumerical":[123],"representation":[124],"edge-lengths.":[126],"\\n":[127,157,197,223,269,296,335,360,377],"provably":[129],"optimal":[130,345,401],"deterministic":[131],"algorithm.":[135,268,323],"(We":[136],"\\ngive":[137],"constructive":[139],"proof":[140],"algorithmic":[143],"\\nspanning":[148],"problem":[150],"is":[151,219,257,285,344,354,393],"equivalent":[152],"its":[154],"decision-tree":[155],"complexity.)":[156],"An":[158,198,270,297,378],"all-pairs":[159,199,389],"algorithm":[162,202,228,318,342,353,368],"graphs":[165,205],"running":[166,206,229],"time":[168,349],"\\nO(mn":[169],"+":[170,259,300],"n2":[171],"\\nlog":[172],"log":[173,209,234,235,238,261,262,302,380,397],"n),":[174,263],"where":[175,213,241],"m":[176,403],"n":[178,237,255,260,301],"edges":[183],"vertices.":[185],"\\nThis":[186],"provides":[187],"first":[189,337],"improvement":[190,265],"over":[191,266],"based":[193],"Dijkstra's":[195,267],"\\nalgorithm.":[196],"undirected":[204],"O(mn":[208,379],"\u03b1":[210,214,216,232,381,398],")":[211,382],"\\ntime,":[212,240],"=":[215,404],"(m,":[217],"n)":[218,303],"inverse-Ackermann":[221,271,288],"function.":[222],"single-source":[225,309],"O(m":[231,258],"+min{n":[233],"r,":[236],"n})":[239],"r":[242,252],"bounds":[243],"ratio":[245],"any":[247,307],"edge":[249],"lengths.":[250],"For":[251],"polynomial":[253],"\\nin":[254],"an":[264],"style":[272],"lower":[273,290,304],"bound":[274,305,383],"online":[277],"\\ntree":[280],"veri":[281],"cation":[282],"problem.":[283,295],"This":[284,392],"rst":[287],"type":[289,316],"\\nbound":[291],"comparison-based":[294],"\\n\u03a9":[298],"(m":[299],"hierarchy-type":[308],"\\npath":[311],"algorithm,":[312],"implying":[313],"cannot":[319],"improve":[320],"upon":[321],"\\nDijkstra's":[322],"(All":[324],"hierarchy":[333],"\\ntype.)":[334],"parallel":[338],"w.r.t.":[346],"\\nboth":[348],"work.":[351],"Our":[352],"EREW":[357],"PRAM":[358],"model.":[359],"parallel,":[362],"expected":[363],"linear-work":[364],"using":[369],"\\nonly":[370],"polylogarithmic":[372],"random":[375],"bits.":[376],"comparison-addition":[386],"\\nshortest":[390],"paths.":[391],"within":[394],"tiny":[396],"factor":[399],"when":[402],"O(n).":[405]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2160495255","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
