{"id":"https://openalex.org/W1501925261","doi":"https://doi.org/10.1109/infcomw.2015.7179461","title":"Shortest paths in networks with correlated link weights","display_name":"Shortest paths in networks with correlated link weights","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1501925261","doi":"https://doi.org/10.1109/infcomw.2015.7179461","mag":"1501925261"},"language":"en","primary_location":{"id":"doi:10.1109/infcomw.2015.7179461","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcomw.2015.7179461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://resolver.tudelft.nl/uuid:e7e1300e-6d34-4c6c-9c6f-7cd828a1a607","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051317379","display_name":"Song Yang","orcid":"https://orcid.org/0000-0002-5385-1402"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Song Yang","raw_affiliation_strings":["Delft University of Technology, The Netherlands","Delft University of Technology, The Netherlands;"],"affiliations":[{"raw_affiliation_string":"Delft University of Technology, The Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Delft University of Technology, The Netherlands;","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058846494","display_name":"Stojan Trajanovski","orcid":"https://orcid.org/0000-0003-0892-9263"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Stojan Trajanovski","raw_affiliation_strings":["Delft University of Technology, The Netherlands","Delft University of Technology, The Netherlands;"],"affiliations":[{"raw_affiliation_string":"Delft University of Technology, The Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Delft University of Technology, The Netherlands;","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069179616","display_name":"Fernando Kuipers","orcid":"https://orcid.org/0000-0002-6686-8350"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Fernando A. Kuipers","raw_affiliation_strings":["Delft University of Technology, The Netherlands","Delft University of Technology, The Netherlands;"],"affiliations":[{"raw_affiliation_string":"Delft University of Technology, The Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Delft University of Technology, The Netherlands;","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051317379"],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":null,"apc_paid":null,"fwci":0.6003,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71070835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"6","issue":null,"first_page":"660","last_page":"665"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9977999925613403,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9977999925613403,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9969000220298767,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7670122385025024},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.7208091020584106},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5511132478713989},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5501419901847839},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5356653928756714},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4949881434440613},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4872194826602936},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.46812406182289124},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4630904495716095},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4407835304737091},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43198078870773315},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42811501026153564},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.41268178820610046},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3531983494758606},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3398156464099884},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29920798540115356}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7670122385025024},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.7208091020584106},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5511132478713989},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5501419901847839},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5356653928756714},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4949881434440613},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4872194826602936},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.46812406182289124},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4630904495716095},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4407835304737091},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43198078870773315},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42811501026153564},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.41268178820610046},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3531983494758606},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3398156464099884},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29920798540115356},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcomw.2015.7179461","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcomw.2015.7179461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"proceedings-article"},{"id":"pmh:tud:oai:tudelft.nl:uuid:e7e1300e-6d34-4c6c-9c6f-7cd828a1a607","is_oa":true,"landing_page_url":"http://resolver.tudelft.nl/uuid:e7e1300e-6d34-4c6c-9c6f-7cd828a1a607","pdf_url":"http://resolver.tudelft.nl/uuid:e7e1300e-6d34-4c6c-9c6f-7cd828a1a607","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings - 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:tud:oai:tudelft.nl:uuid:e7e1300e-6d34-4c6c-9c6f-7cd828a1a607","is_oa":true,"landing_page_url":"http://resolver.tudelft.nl/uuid:e7e1300e-6d34-4c6c-9c6f-7cd828a1a607","pdf_url":"http://resolver.tudelft.nl/uuid:e7e1300e-6d34-4c6c-9c6f-7cd828a1a607","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings - 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"info:eu-repo/semantics/conferencepaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1501925261.pdf"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1507240584","https://openalex.org/W1535372989","https://openalex.org/W1822044859","https://openalex.org/W1847903816","https://openalex.org/W1968164782","https://openalex.org/W1976699101","https://openalex.org/W2011039300","https://openalex.org/W2017996596","https://openalex.org/W2068394611","https://openalex.org/W2081730757","https://openalex.org/W2099553443","https://openalex.org/W2111022489","https://openalex.org/W2114707436","https://openalex.org/W2119775299","https://openalex.org/W2125825623","https://openalex.org/W2143235229","https://openalex.org/W2148863662","https://openalex.org/W2153730762","https://openalex.org/W2156307401","https://openalex.org/W2161201881","https://openalex.org/W2169528473","https://openalex.org/W2296319761","https://openalex.org/W3121701465","https://openalex.org/W4250589301","https://openalex.org/W6630298579","https://openalex.org/W6631855779","https://openalex.org/W6638734688","https://openalex.org/W6638742730","https://openalex.org/W6681966990"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2156431668","https://openalex.org/W2144050074","https://openalex.org/W2030169809","https://openalex.org/W2020255949","https://openalex.org/W1990957023","https://openalex.org/W2349797546","https://openalex.org/W2369379323","https://openalex.org/W2469035159","https://openalex.org/W2359382971"],"abstract_inverted_index":{"Solving":[0],"the":[1,46,91,97,105,117,124,140,146,163,168],"shortest":[2,106,118,147,164],"path":[3,107,119,148,165],"problem":[4,35,108,120,149,166],"is":[5,36,121,150],"important":[6],"in":[7,16,38,42,70,136],"achieving":[8],"high":[9],"performance":[10],"or":[11,60],"to":[12,58,133],"efficiently":[13],"utilize":[14],"resources":[15],"various":[17],"kinds":[18],"of":[19],"networks,":[20,45],"e.g.,":[21],"data":[22],"communication":[23],"networks":[24],"and":[25,74,95,128],"transportation":[26],"networks.":[27],"Fortunately,":[28],"under":[29,109,123,153,167],"independent":[30],"additive":[31],"link":[32,47,65],"weights,":[33],"this":[34,80],"solvable":[37,152],"polynomial":[39,137],"time.":[40,138],"However,":[41],"many":[43],"real-life":[44],"weights":[48,66],"(e.g.,":[49],"delay,":[50],"bandwidth,":[51],"failure":[52],"probability)":[53],"are":[54,75],"often":[55],"correlated":[56,64,86,93,100,112,126,157,171],"due":[57],"spatial":[59],"temporal":[61],"dependencies.":[62],"These":[63],"together":[67],"might":[68],"behave":[69],"a":[71,154],"different":[72],"manner":[73],"not":[76],"always":[77],"additive.":[78],"In":[79],"paper,":[81],"we":[82,103,143,160],"first":[83],"propose":[84],"two":[85,111],"link-weight":[87],"models,":[88],"namely":[89],"(i)":[90],"deterministic":[92,125,156],"model":[94,172],"(ii)":[96],"(log-concave)":[98,169],"stochastic":[99,170],"model.":[101,158],"Subsequently,":[102],"study":[104],"these":[110],"models.":[113],"We":[114],"prove":[115],"that":[116,145,162],"NP-hard":[122],"model,":[127],"even":[129],"cannot":[130],"be":[131,174],"approximated":[132],"arbitrary":[134],"degree":[135],"On":[139],"other":[141],"hand,":[142],"show":[144,161],"polynomial-time":[151],"nodal":[155],"Finally,":[159],"can":[173],"solved":[175],"by":[176],"convex":[177],"optimization.":[178]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-10-10T00:00:00"}