{"id":"https://openalex.org/W2782743306","doi":"https://doi.org/10.1109/tkde.2018.2792470","title":"Making a Small World Smaller: Path Optimization in Networks","display_name":"Making a Small World Smaller: Path Optimization in Networks","publication_year":2018,"publication_date":"2018-01-12","ids":{"openalex":"https://openalex.org/W2782743306","doi":"https://doi.org/10.1109/tkde.2018.2792470","mag":"2782743306"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2018.2792470","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2018.2792470","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Knowledge and Data 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/A5049055881","display_name":"Sourav Medya","orcid":"https://orcid.org/0000-0003-0996-2807"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sourav Medya","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001272357","display_name":"Petko Bogdanov","orcid":"https://orcid.org/0000-0001-6310-3224"},"institutions":[{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Petko Bogdanov","raw_affiliation_strings":["Department of Computer Science, University at Albany, SUNY, Albany, NY"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University at Albany, SUNY, Albany, NY","institution_ids":["https://openalex.org/I392282"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036639779","display_name":"Ambuj K. Singh","orcid":"https://orcid.org/0000-0002-1997-7140"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ambuj Singh","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5049055881"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":0.7541,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.69579939,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"30","issue":"8","first_page":"1533","last_page":"1546"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9876000285148621,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.7457184195518494},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6788005828857422},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5763440728187561},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5091907382011414},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47995904088020325},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4165947437286377},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37476301193237305},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1834965944290161},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15078914165496826},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10764467716217041},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10028064250946045}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7457184195518494},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6788005828857422},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5763440728187561},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5091907382011414},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47995904088020325},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4165947437286377},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37476301193237305},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1834965944290161},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15078914165496826},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10764467716217041},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10028064250946045},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tkde.2018.2792470","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2018.2792470","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Knowledge and Data Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G948678646","display_name":null,"funder_award_id":"W911NF-09-2-0053","funder_id":"https://openalex.org/F4320338295","funder_display_name":"Army Research Laboratory"}],"funders":[{"id":"https://openalex.org/F4320338295","display_name":"Army Research Laboratory","ror":"https://ror.org/011hc8f90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W85521454","https://openalex.org/W141711295","https://openalex.org/W815720198","https://openalex.org/W1029409534","https://openalex.org/W1580292412","https://openalex.org/W1583500311","https://openalex.org/W1584910000","https://openalex.org/W1591583224","https://openalex.org/W1899379166","https://openalex.org/W1944367023","https://openalex.org/W1964869462","https://openalex.org/W1984069252","https://openalex.org/W1997783781","https://openalex.org/W1999101712","https://openalex.org/W2009305899","https://openalex.org/W2018715584","https://openalex.org/W2029538739","https://openalex.org/W2038478460","https://openalex.org/W2046651078","https://openalex.org/W2047897941","https://openalex.org/W2053572557","https://openalex.org/W2055721472","https://openalex.org/W2061820396","https://openalex.org/W2067935583","https://openalex.org/W2072485026","https://openalex.org/W2083649025","https://openalex.org/W2089867501","https://openalex.org/W2094827579","https://openalex.org/W2096423888","https://openalex.org/W2103012681","https://openalex.org/W2112556110","https://openalex.org/W2126021606","https://openalex.org/W2149161872","https://openalex.org/W2165314203","https://openalex.org/W2407891964","https://openalex.org/W2476075474","https://openalex.org/W2563448420","https://openalex.org/W2963531920","https://openalex.org/W2964000883","https://openalex.org/W3150625878","https://openalex.org/W4205585032","https://openalex.org/W4233413206","https://openalex.org/W4238284510","https://openalex.org/W4298135524","https://openalex.org/W6603479127","https://openalex.org/W6634743436","https://openalex.org/W6640862447","https://openalex.org/W6730638611"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W4312723892","https://openalex.org/W2783065147","https://openalex.org/W1827895227","https://openalex.org/W4285104409","https://openalex.org/W4210317843"],"abstract_inverted_index":{"Reduction":[0],"of":[1,25,41,46,60,71,84,99,118,156,208,246],"end-to-end":[2],"network":[3,77,119,212],"delay":[4,107,120,209],"is":[5,80,95,130],"an":[6],"optimization":[7],"task":[8],"with":[9,198,219],"applications":[10],"in":[11,20,27,43,67,75,177,227,263],"multiple":[12],"domains.":[13],"Low":[14],"delays":[15],"enable":[16,188],"improved":[17],"information":[18],"flow":[19],"social":[21],"networks,":[22,29,37,192,258],"quick":[23],"spread":[24],"ideas":[26],"collaboration":[28],"low":[30],"travel":[31],"times":[32],"for":[33,142,152,196,201],"vehicles":[34],"on":[35,233,255,265],"road":[36],"and":[38,63,90,111,132,211,223,259],"increased":[39],"rate":[40],"packets":[42],"the":[44,57,68,72,82,104,116,128,147,157,169,220,253,271],"case":[45],"communication":[47],"networks.":[48],"Delay":[49],"reduction":[50],"can":[51,159],"be":[52,160],"achieved":[53],"by":[54],"both":[55],"improving":[56],"propagation":[58,106],"capabilities":[59],"individual":[61],"nodes":[62],"adding":[64],"additional":[65],"edges":[66],"network.":[69],"One":[70],"main":[73],"challenges":[74],"such":[76],"design":[78],"problems":[79],"that":[81,127],"effects":[83],"local":[85],"changes":[86],"are":[87],"not":[88,181],"independent,":[89],"as":[91],"a":[92,96,153,164],"consequence,":[93],"there":[94],"combinatorial":[97],"search-space":[98],"possible":[100],"improvements.":[101],"Thus,":[102],"minimizing":[103],"cumulative":[105],"requires":[108],"novel":[109],"scalable":[110],"data-driven":[112],"approaches.":[113],"We":[114,125,162,229,240],"consider":[115],"problem":[117,129,158,171],"minimization":[121],"via":[122],"node":[123],"upgrades.":[124],"show":[126],"NP-hard":[131],"prove":[133],"strong":[134],"inapproximability":[135],"results":[136,262],"about":[137],"it":[138],"(i.e.,":[139],"APX-hard)":[140],"even":[141],"equal":[143],"vertex":[144],"delays.":[145],"On":[146],"positive":[148],"side,":[149],"probabilistic":[150,199],"approximations":[151,195],"restricted":[154],"version":[155],"obtained.":[161],"propose":[163],"greedy":[165],"heuristic":[166],"to":[167,183,190,205,243,250],"solve":[168],"general":[170],"setting":[172],"which":[173],"has":[174],"good":[175],"quality":[176],"practice,":[178],"but":[179],"does":[180],"scale":[182,216],"very":[184],"large":[185,266],"instances.":[186],"To":[187],"scalability":[189],"real-world":[191,235],"we":[193],"develop":[194],"Greedy":[197],"guarantees":[200],"every":[202],"iteration,":[203],"tailored":[204],"different":[206,238],"models":[207],"distribution":[210],"structures.":[213],"Our":[214],"methods":[215],"almost":[217],"linearly":[218],"graph":[221],"size":[222,257],"consistently":[224],"outperform":[225],"competitors":[226,269],"quality.":[228],"evaluate":[230],"our":[231],"approaches":[232],"several":[234],"graphs":[236],"from":[237,252,270],"genres.":[239],"achieve":[241],"up":[242],"two":[244],"orders":[245],"magnitude":[247],"speed-up":[248],"compared":[249],"alternatives":[251],"literature":[254,272],"moderate":[256],"obtain":[260],"high-quality":[261],"minutes":[264],"datasets":[267],"while":[268],"require":[273],"more":[274],"than":[275],"four":[276],"hours.":[277]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}