{"id":"https://openalex.org/W3004486170","doi":"https://doi.org/10.3390/a13020036","title":"Approximation Algorithm for Shortest Path in Large Social Networks","display_name":"Approximation Algorithm for Shortest Path in Large Social Networks","publication_year":2020,"publication_date":"2020-02-06","ids":{"openalex":"https://openalex.org/W3004486170","doi":"https://doi.org/10.3390/a13020036","mag":"3004486170"},"language":"en","primary_location":{"id":"doi:10.3390/a13020036","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13020036","pdf_url":"https://www.mdpi.com/1999-4893/13/2/36/pdf?version=1580990211","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/2/36/pdf?version=1580990211","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017271417","display_name":"Dennis Nii Ayeh Mensah","orcid":"https://orcid.org/0000-0003-4011-3803"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Dennis Nii Ayeh Mensah","raw_affiliation_strings":["Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 610051, China"],"affiliations":[{"raw_affiliation_string":"Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 610051, China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101603187","display_name":"Hui Gao","orcid":"https://orcid.org/0000-0002-9557-7739"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hui Gao","raw_affiliation_strings":["Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 610051, China"],"affiliations":[{"raw_affiliation_string":"Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 610051, China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001633360","display_name":"Liangwei Yang","orcid":"https://orcid.org/0000-0001-5660-766X"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Liang Wei Yang","raw_affiliation_strings":["Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 610051, China"],"affiliations":[{"raw_affiliation_string":"Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 610051, China","institution_ids":["https://openalex.org/I150229711"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017271417"],"corresponding_institution_ids":["https://openalex.org/I150229711"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.3276,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.79221511,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"13","issue":"2","first_page":"36","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9994999766349792,"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.9994999766349792,"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/T11106","display_name":"Data Management and Algorithms","score":0.9991999864578247,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9932000041007996,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7674846649169922},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7087457180023193},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6621635556221008},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6542808413505554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6381299495697021},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.6154912710189819},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.6022027730941772},{"id":"https://openalex.org/keywords/hierarchical-network-model","display_name":"Hierarchical network model","score":0.5021207332611084},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.49506106972694397},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.48129644989967346},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4753651022911072},{"id":"https://openalex.org/keywords/complex-network","display_name":"Complex network","score":0.45826277136802673},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4237046241760254},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3254713714122772},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3155120611190796},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2957629859447479},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09594038128852844}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7674846649169922},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7087457180023193},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6621635556221008},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6542808413505554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6381299495697021},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.6154912710189819},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.6022027730941772},{"id":"https://openalex.org/C64900535","wikidata":"https://www.wikidata.org/wiki/Q5753111","display_name":"Hierarchical network model","level":3,"score":0.5021207332611084},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.49506106972694397},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.48129644989967346},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4753651022911072},{"id":"https://openalex.org/C34947359","wikidata":"https://www.wikidata.org/wiki/Q665189","display_name":"Complex network","level":2,"score":0.45826277136802673},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4237046241760254},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3254713714122772},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3155120611190796},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2957629859447479},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09594038128852844},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a13020036","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13020036","pdf_url":"https://www.mdpi.com/1999-4893/13/2/36/pdf?version=1580990211","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:d1593833dd764e31951ad6aff097169e","is_oa":true,"landing_page_url":"https://doaj.org/article/d1593833dd764e31951ad6aff097169e","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 2, p 36 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/2/36/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a13020036","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13020036","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13020036","pdf_url":"https://www.mdpi.com/1999-4893/13/2/36/pdf?version=1580990211","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3004486170.pdf","grobid_xml":"https://content.openalex.org/works/W3004486170.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W155995321","https://openalex.org/W1209362753","https://openalex.org/W1497249636","https://openalex.org/W1969483458","https://openalex.org/W1994681563","https://openalex.org/W2019275299","https://openalex.org/W2024733248","https://openalex.org/W2056944867","https://openalex.org/W2067387861","https://openalex.org/W2087607958","https://openalex.org/W2087670477","https://openalex.org/W2140271346","https://openalex.org/W2148831787","https://openalex.org/W2167262444","https://openalex.org/W2333683078","https://openalex.org/W2374228513","https://openalex.org/W2409471617","https://openalex.org/W3146002743","https://openalex.org/W6667225350"],"related_works":["https://openalex.org/W2358661218","https://openalex.org/W2354846196","https://openalex.org/W2392078542","https://openalex.org/W2357391150","https://openalex.org/W2030169809","https://openalex.org/W2106745518","https://openalex.org/W2347831319","https://openalex.org/W2161960576","https://openalex.org/W2371371223","https://openalex.org/W3004486170"],"abstract_inverted_index":{"Proposed":[0],"algorithms":[1,12],"for":[2],"calculating":[3],"the":[4,66,78],"shortest":[5,61,75],"paths":[6,62,76],"such":[7],"as":[8],"Dijikstra":[9],"and":[10,22,28,93],"Flowd-Warshall\u2019s":[11],"are":[13,69],"limited":[14],"to":[15,19,37,54],"small":[16],"networks":[17,48],"due":[18],"computational":[20],"complexity":[21],"cost.":[23],"We":[24],"propose":[25],"an":[26],"efficient":[27],"a":[29,50],"more":[30],"accurate":[31],"approximation":[32],"algorithm":[33,42,89],"that":[34,87],"is":[35],"applicable":[36],"large":[38],"scale":[39],"networks.":[40],"Our":[41],"iteratively":[43],"constructs":[44],"levels":[45],"of":[46],"hierarchical":[47,56],"by":[49,71],"node":[51],"condensing":[52],"procedure":[53],"construct":[55],"graphs":[57],"until":[58],"threshold.":[59],"The":[60],"between":[63],"nodes":[64],"in":[65,77],"original":[67],"network":[68],"approximated":[70],"considering":[72],"their":[73],"corresponding":[74],"highest":[79],"hierarchy.":[80],"Experiments":[81],"on":[82],"real":[83],"life":[84],"data":[85],"show":[86],"our":[88],"records":[90],"high":[91],"efficiency":[92],"accuracy":[94],"compared":[95],"with":[96],"other":[97],"algorithms.":[98]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}