{"id":"https://openalex.org/W2761598111","doi":"https://doi.org/10.1109/infocom.2017.8057094","title":"Complexity vs. optimality: Unraveling source-destination connection in uncertain graphs","display_name":"Complexity vs. optimality: Unraveling source-destination connection in uncertain graphs","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2761598111","doi":"https://doi.org/10.1109/infocom.2017.8057094","mag":"2761598111"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2017.8057094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2017.8057094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2017 - IEEE Conference on Computer Communications","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/A5049286032","display_name":"Xinzhe Fu","orcid":"https://orcid.org/0000-0002-4425-3881"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xinzhe Fu","raw_affiliation_strings":["Dept. of Computer Science, Shanghai Jiao Tong University, China"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Shanghai Jiao Tong University, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100301744","display_name":"Zhiying Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhiying Xu","raw_affiliation_strings":["Dept. of Electronic Engineering, Shanghai Jiao Tong University, China"],"affiliations":[{"raw_affiliation_string":"Dept. of Electronic Engineering, Shanghai Jiao Tong University, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023774653","display_name":"Qianyang Peng","orcid":null},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qianyang Peng","raw_affiliation_strings":["Dept. of Computer Science, Shanghai Jiao Tong University, China"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Shanghai Jiao Tong University, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048486573","display_name":"Luoyi Fu","orcid":"https://orcid.org/0000-0001-7796-9168"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Luoyi Fu","raw_affiliation_strings":["Dept. of Computer Science, Shanghai Jiao Tong University, China"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Shanghai Jiao Tong University, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034483183","display_name":"Xinbing Wang","orcid":"https://orcid.org/0000-0002-0357-8356"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinbing Wang","raw_affiliation_strings":["Dept. of Electronic Engineering, Shanghai Jiao Tong University, China"],"affiliations":[{"raw_affiliation_string":"Dept. of Electronic Engineering, Shanghai Jiao Tong University, China","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5049286032"],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":2.072,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.89000625,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9882000088691711,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9830999970436096,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.5729572772979736},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5321874618530273},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4889148771762848},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47814831137657166},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.46885356307029724},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.46652019023895264},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46350401639938354},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4587019681930542},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.420485258102417},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4071393311023712},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3704909384250641},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35454264283180237},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30799975991249084}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5729572772979736},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5321874618530273},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4889148771762848},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47814831137657166},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.46885356307029724},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.46652019023895264},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46350401639938354},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4587019681930542},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.420485258102417},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4071393311023712},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3704909384250641},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35454264283180237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30799975991249084},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2017.8057094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2017.8057094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2017 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1542177083","https://openalex.org/W1636002480","https://openalex.org/W1669491564","https://openalex.org/W1784783114","https://openalex.org/W1975407578","https://openalex.org/W1987480024","https://openalex.org/W1991536882","https://openalex.org/W1992876208","https://openalex.org/W1993709643","https://openalex.org/W1998369386","https://openalex.org/W2026501144","https://openalex.org/W2031264603","https://openalex.org/W2037933327","https://openalex.org/W2042307930","https://openalex.org/W2061820396","https://openalex.org/W2066303519","https://openalex.org/W2082931591","https://openalex.org/W2094500233","https://openalex.org/W2110896443","https://openalex.org/W2119567691","https://openalex.org/W2126969025","https://openalex.org/W2136618432","https://openalex.org/W2139694815","https://openalex.org/W2155461593","https://openalex.org/W2158804164","https://openalex.org/W2167689112","https://openalex.org/W2274419069","https://openalex.org/W2401697020","https://openalex.org/W2522473921","https://openalex.org/W2951161395","https://openalex.org/W2962795549","https://openalex.org/W3217684393","https://openalex.org/W4232932184","https://openalex.org/W4298023569","https://openalex.org/W6636851552","https://openalex.org/W6637916222","https://openalex.org/W6676553512","https://openalex.org/W6694480088","https://openalex.org/W6726890790"],"related_works":["https://openalex.org/W587735977","https://openalex.org/W1978142926","https://openalex.org/W3157395178","https://openalex.org/W184455116","https://openalex.org/W2058473748","https://openalex.org/W963756281","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532","https://openalex.org/W961142965"],"abstract_inverted_index":{"Determination":[0],"of":[1,57,63,97,109,152,165,194,277,293],"source-destination":[2,155],"connectivity":[3,156],"in":[4,26,157,177,185,227],"networks":[5],"has":[6,262],"long":[7],"been":[8],"a":[9,60,65,69,75,80,107,136,142,209,245,283],"fundamental":[10],"problem,":[11,145,279],"where":[12,42],"most":[13],"existing":[14],"works":[15],"are":[16,72,89,297],"based":[17],"on":[18,302],"deterministic":[19,178],"graphs":[20,133],"that":[21,56,83,134,213,256,311],"overlook":[22],"the":[23,36,95,120,126,149,163,192,202,215,219,239,275,278,294,312],"inherent":[24],"uncertainty":[25],"network":[27,37,305],"links.":[28],"To":[29],"overcome":[30],"such":[31],"limitation,":[32],"this":[33,180],"paper":[34],"models":[35],"as":[38,258],"an":[39,92,116,196],"uncertain":[40,158],"graph":[41],"each":[43,85,98],"edge":[44,99,104],"e":[45],"exists":[46],"independently":[47],"with":[48,91,125,249,287,317],"some":[49,266],"probability":[50],"p(e).":[51],"The":[52,241,291],"problem":[53,181],"examined":[54],"is":[55,113,244],"determining":[58,86,154],"whether":[59],"given":[61],"pair":[62],"nodes,":[64],"source":[66],"s":[67],"and":[68],"destination":[70],"t,":[71],"connected":[73],"by":[74,79,191,273],"path":[76],"or":[77],"separated":[78],"cut.":[81],"Assuming":[82],"during":[84],"process":[87],"we":[88,146,170,199,230,254,280,309],"associated":[90],"underlying":[93,132],"graph,":[94],"existence":[96],"can":[100],"be":[101,183],"unraveled":[102],"through":[103,161,299],"testing":[105,123],"at":[106],"cost":[108,124,320],"c(e).":[110],"Our":[111],"goal":[112],"to":[114,174,207],"find":[115],"optimal":[117,216],"strategy":[118],"incurring":[119],"minimum":[121],"expected":[122,319],"expectation":[127],"taken":[128],"over":[129],"all":[130],"possible":[131],"form":[135],"product":[137],"distribution.":[138],"Formulating":[139],"it":[140,259,261],"into":[141],"combinatorial":[143],"optimization":[144],"first":[147,242],"characterize":[148],"computational":[150],"complexity":[151,226],"optimally":[153],"graphs.":[159],"Specifically,":[160],"proving":[162],"NP-hardness":[164],"two":[166,233],"closely":[167],"related":[168],"problems,":[169],"show":[171,255],"that,":[172],"contrary":[173],"its":[175],"counterpart":[176],"graphs,":[179],"cannot":[182],"solved":[184],"polynomial":[186],"time":[187,225],"unless":[188],"P=NP.":[189],"Driven":[190],"necessity":[193],"designing":[195],"exact":[197,220],"algorithm,":[198],"then":[200],"apply":[201],"Markov":[203],"Decision":[204],"Process":[205],"framework":[206],"give":[208],"dynamic":[210],"programming":[211],"algorithm":[212,221,286],"derives":[214],"strategies.":[217],"As":[218],"may":[222],"have":[223],"prohibitive":[224],"practical":[228],"situations,":[229],"further":[231,281],"propose":[232],"more":[234,269,284],"efficient":[235],"approximation":[236,251,289],"schemes":[237],"compromising":[238],"optimality.":[240],"one":[243],"simple":[246],"greedy":[247],"approach":[248],"linear":[250],"ratio.":[252,290],"Interestingly,":[253],"naive":[257],"is,":[260],"comparable":[263],"performance":[264],"than":[265,321],"other":[267],"seemingly":[268],"sophisticated":[270],"algorithms.":[271],"Second,":[272],"harnessing":[274],"sub-modularity":[276],"design":[282],"elaborate":[285],"better":[288],"effectiveness":[292],"proposed":[295,313],"algorithms":[296,314],"justified":[298],"extensive":[300],"simulations":[301],"three":[303],"real":[304],"datasets,":[306],"from":[307],"which":[308],"demonstrate":[310],"yield":[315],"strategies":[316],"smaller":[318],"conventional":[322],"heuristics.":[323]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}