{"id":"https://openalex.org/W2465832610","doi":"https://doi.org/10.1109/tnse.2016.2586750","title":"Efficient Multistate Route Computation","display_name":"Efficient Multistate Route Computation","publication_year":2016,"publication_date":"2016-06-30","ids":{"openalex":"https://openalex.org/W2465832610","doi":"https://doi.org/10.1109/tnse.2016.2586750","mag":"2465832610"},"language":"en","primary_location":{"id":"doi:10.1109/tnse.2016.2586750","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnse.2016.2586750","pdf_url":null,"source":{"id":"https://openalex.org/S2484352698","display_name":"IEEE Transactions on Network Science and Engineering","issn_l":"2327-4697","issn":["2327-4697","2334-329X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Network Science and Engineering","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/A5006398849","display_name":"David L. Rhodes","orcid":"https://orcid.org/0000-0001-9244-8707"},"institutions":[{"id":"https://openalex.org/I4210107413","display_name":"SouthCoast Health","ror":"https://ror.org/01mgpsx86","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210107413"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David L. Rhodes","raw_affiliation_strings":["Opcoast, Brick, NJ"],"raw_orcid":"https://orcid.org/0000-0001-9244-8707","affiliations":[{"raw_affiliation_string":"Opcoast, Brick, NJ","institution_ids":["https://openalex.org/I4210107413"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006398849"],"corresponding_institution_ids":["https://openalex.org/I4210107413"],"apc_list":null,"apc_paid":null,"fwci":0.2544,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5204004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":"3","first_page":"171","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9674000144004822,"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/computation","display_name":"Computation","score":0.6588413715362549},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5294247269630432},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5022492408752441},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4898785948753357},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45686835050582886},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.44767439365386963},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.44066929817199707},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4382122755050659},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39897850155830383},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39311447739601135},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3559345006942749},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08460691571235657}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6588413715362549},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5294247269630432},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5022492408752441},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4898785948753357},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45686835050582886},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.44767439365386963},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.44066929817199707},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4382122755050659},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39897850155830383},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39311447739601135},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3559345006942749},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08460691571235657},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnse.2016.2586750","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnse.2016.2586750","pdf_url":null,"source":{"id":"https://openalex.org/S2484352698","display_name":"IEEE Transactions on Network Science and Engineering","issn_l":"2327-4697","issn":["2327-4697","2334-329X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Network Science and Engineering","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":29,"referenced_works":["https://openalex.org/W1836372424","https://openalex.org/W1969261977","https://openalex.org/W1980917656","https://openalex.org/W1984407615","https://openalex.org/W2034204928","https://openalex.org/W2039033548","https://openalex.org/W2039114216","https://openalex.org/W2044962958","https://openalex.org/W2046236705","https://openalex.org/W2048608180","https://openalex.org/W2052056774","https://openalex.org/W2062568266","https://openalex.org/W2068851130","https://openalex.org/W2092499098","https://openalex.org/W2114158004","https://openalex.org/W2114234222","https://openalex.org/W2119026002","https://openalex.org/W2126863958","https://openalex.org/W2131058166","https://openalex.org/W2142243625","https://openalex.org/W2164934513","https://openalex.org/W2169528473","https://openalex.org/W2189277585","https://openalex.org/W2227557434","https://openalex.org/W3148160083","https://openalex.org/W4243529478","https://openalex.org/W4285719527","https://openalex.org/W6645448960","https://openalex.org/W6686805358"],"related_works":["https://openalex.org/W2959160600","https://openalex.org/W1932159282","https://openalex.org/W2052899165","https://openalex.org/W2008562718","https://openalex.org/W4312006216","https://openalex.org/W4286800113","https://openalex.org/W4324301570","https://openalex.org/W2119956050","https://openalex.org/W2078163775","https://openalex.org/W4377299729"],"abstract_inverted_index":{"A":[0],"multi-state":[1],"graph":[2,7],"is":[3,11,26,36,70,133],"defined":[4],"as":[5,60,62],"a":[6,14,30,120,130],"where":[8,22],"each":[9],"edge":[10,51,92],"associated":[12],"with":[13],"stochastic,":[15],"rather":[16],"than":[17],"fixed,":[18],"value.":[19],"For":[20],"cases":[21],"the":[23,41,82,96,99,105,117,146,153],"stochastic":[24],"value":[25],"discrete":[27],"and":[28,45,54,77,110],"represents":[29],"distance":[31],"or":[32],"time,":[33],"an":[34],"algorithm":[35],"presented":[37,134],"which":[38],"efficiently":[39],"finds":[40],"single-source":[42],"shortest":[43,157],"paths":[44,158],"distances":[46],"for":[47,81,95],"all":[48],"combinations":[49],"of":[50,84,145,155],"values.":[52],"Infinite":[53],"negative":[55,66],"weight":[56,67],"values":[57],"are":[58,64,113,148],"allowed":[59],"long":[61],"there":[63],"no":[65],"cycles.":[68],"Efficiency":[69],"achieved":[71],"by":[72,125],"both":[73],"leveraging":[74,126],"dynamic":[75],"programming":[76],"only":[78],"finding":[79],"solutions":[80],"set":[83],"dominant":[85],"states":[86],"that":[87,135],"correctly":[88],"cover":[89],"any":[90],"possible":[91],"metric":[93],"setting":[94],"graph.":[97],"Although":[98],"method":[100,147],"has":[101],"exponential":[102],"complexity":[103],"in":[104],"worst":[106],"case,":[107],"some":[108,127],"samples":[109],"example":[111],"graphs":[112],"used":[114],"to":[115,139,151],"illustrate":[116],"savings":[118],"over":[119],"brute-force":[121],"combinatoric":[122],"approach.":[123],"Furthermore":[124],"real-world":[128],"assumptions,":[129],"pseudo-polynomial":[131],"version":[132],"can":[136],"be":[137],"applied":[138],"larger":[140],"scale":[141],"problems.":[142],"The":[143],"results":[144],"then":[149],"shown":[150],"enable":[152],"computation":[154],"most-likely":[156],".":[159]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}