{"id":"https://openalex.org/W4248675866","doi":"https://doi.org/10.1109/aspdac.2006.1594811","title":"An exact algorithm for the statistical shortest path problem","display_name":"An exact algorithm for the statistical shortest path problem","publication_year":2006,"publication_date":"2006-03-22","ids":{"openalex":"https://openalex.org/W4248675866","doi":"https://doi.org/10.1109/aspdac.2006.1594811"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2006.1594811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2006.1594811","pdf_url":null,"source":{"id":"https://openalex.org/S4363608292","display_name":"Asia and South Pacific Conference on Design Automation, 2006.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia and South Pacific Conference on Design Automation, 2006.","raw_type":"proceedings-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/A5103259452","display_name":"Liang Deng","orcid":"https://orcid.org/0000-0001-7760-0539"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Liang Deng","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053378706","display_name":"Martin D. F. Wong","orcid":"https://orcid.org/0000-0001-8274-9688"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.D.F. Wong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103259452"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.51628174,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"965","last_page":"970"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.6441910266876221},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6130596399307251},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6076894998550415},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.5090129375457764},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.508429229259491},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4971344769001007},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.480927437543869},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4629133343696594},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4467311203479767},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4401853680610657},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4280416965484619},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14999672770500183},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.11203187704086304},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10601124167442322}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6441910266876221},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6130596399307251},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6076894998550415},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.5090129375457764},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.508429229259491},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4971344769001007},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.480927437543869},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4629133343696594},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4467311203479767},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4401853680610657},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4280416965484619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14999672770500183},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11203187704086304},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10601124167442322},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aspdac.2006.1594811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2006.1594811","pdf_url":null,"source":{"id":"https://openalex.org/S4363608292","display_name":"Asia and South Pacific Conference on Design Automation, 2006.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia and South Pacific Conference on Design Automation, 2006.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4000000059604645,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1527137186","https://openalex.org/W2016049811","https://openalex.org/W2062568266","https://openalex.org/W2117648153","https://openalex.org/W2119702428","https://openalex.org/W2125916239","https://openalex.org/W2126564504","https://openalex.org/W2163262735","https://openalex.org/W2171365326","https://openalex.org/W3183881215","https://openalex.org/W4230035938","https://openalex.org/W4250244573","https://openalex.org/W4250849991","https://openalex.org/W4253814782","https://openalex.org/W6641884055","https://openalex.org/W6678664461","https://openalex.org/W6681789441","https://openalex.org/W6685481653"],"related_works":["https://openalex.org/W4402427056","https://openalex.org/W238609530","https://openalex.org/W2734192830","https://openalex.org/W3016395638","https://openalex.org/W1636163329","https://openalex.org/W3045121788","https://openalex.org/W3201655533","https://openalex.org/W3127082728","https://openalex.org/W2067936666","https://openalex.org/W2089439745"],"abstract_inverted_index":{"Graph":[0],"algorithms":[1,10,241,267,285],"are":[2,65,225],"widely":[3],"used":[4],"in":[5,36,72,175,216,233],"VLSI":[6,19],"CAD.":[7],"Traditional":[8],"graph":[9,58],"can":[11,247,286],"handle":[12,288],"graphs":[13,251],"with":[14,186],"deterministic":[15],"edge":[16,34,61,86],"weights.":[17],"As":[18],"technology":[20],"continues":[21],"to":[22,29,38,42,121,130,182,211,239,257,307],"scale":[23],"into":[24],"nanometer":[25],"designs,":[26],"we":[27,48,98,206,246,300],"need":[28],"use":[30],"probability":[31],"distributions":[32,264,272],"for":[33,184,197,242,270],"weights":[35,62,87],"order":[37],"model":[39],"uncertainty":[40,174],"due":[41],"parameter":[43,316],"variations.":[44,317],"In":[45,114,203],"this":[46,204],"paper,":[47,205],"consider":[49],"the":[50,60,82,115,132,161,176,213,226,283,289,304],"statistical":[51],"shortest":[52],"path":[53,70,124],"(SSP)":[54],"problem.":[55],"Given":[56],"a":[57,94,123,198],"G,":[59,73],"of":[63,84,228,282,303],"G":[64],"random":[66,95],"variables.":[67],"For":[68],"each":[69],"P":[71,125],"let":[74,99],"L/sub":[75,91],"P/":[76,92],"be":[77,108],"its":[78,109],"length,":[79],"which":[80],"is":[81,93,120,148,164,180,237],"sum":[83],"all":[85],"on":[88],"P.":[89],"Clearly":[90],"variable":[96],"and":[97,103,111,223,230,276,312],"/spl":[100,104,135,139,146,155,159,165,190,194,292],"mu//sub":[101,136,166,293],"P/,":[102,167,294],"omega//sub":[105,142,170,191,297],"P//sup":[106,143,192],"3/":[107],"mean":[110],"variance,":[112,188],"respectively.":[113],"SSP":[116,214,243,305],"problem,":[117],"our":[118],"goal":[119],"find":[122],"connecting":[126],"two":[127],"given":[128,199],"vertices":[129,229],"minimize":[131,173],"cost":[133,162,279,290],"function":[134,163,280,291],"p/,":[137],"+":[138,168,218,295],"Phi/":[140,147,156],"(/spl":[141,157],"2/)":[144],"where":[145,221],"an":[149,208],"arbitrary":[150,262],"function.":[151],"(For":[152],"example,":[153],"if":[154],"times/)":[158],"equiv/":[160],"3/spl":[169,296],"P/.)":[171],"To":[172],"final":[177],"result,":[178],"it":[179],"meaningful":[181],"look":[183],"paths":[185],"bounded":[187],"i.e.,":[189],"2/":[193],"les/":[195],"B":[196],"fixed":[200],"bound":[201],"B.":[202],"present":[207],"exact":[209],"algorithm":[210,236],"solve":[212],"problem":[215,244,306],"O(B(V":[217],"E))":[219],"time":[220],"V":[222],"E":[224],"numbers":[227],"edges,":[231],"respectively,":[232],"G.":[234],"Our":[235],"superior":[238],"previous":[240,253,266,284],"because":[245],"handle:":[248],"1)":[249],"general":[250,278],"(unlike":[252,265],"works":[254],"applicable":[255],"only":[256,269],"directed":[258],"acyclic":[259],"graphs),":[260],"2)":[261],"edge-weight":[263],"designed":[268],"specific":[271],"such":[273],"as":[274],"Gaussian),":[275],"3)":[277],"(none":[281],"even":[287],"P/.":[298],"Finally,":[299],"discuss":[301],"applications":[302],"maze":[308],"routing,":[309],"buffer":[310],"insertions,":[311],"timing":[313],"analysis":[314],"under":[315]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}