{"id":"https://openalex.org/W2621797668","doi":"https://doi.org/10.1093/comnet/cnx008","title":"Shortest path tree sampling for landmark selection in large networks","display_name":"Shortest path tree sampling for landmark selection in large networks","publication_year":2017,"publication_date":"2017-04-12","ids":{"openalex":"https://openalex.org/W2621797668","doi":"https://doi.org/10.1093/comnet/cnx008","mag":"2621797668"},"language":"en","primary_location":{"id":"doi:10.1093/comnet/cnx008","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comnet/cnx008","pdf_url":null,"source":{"id":"https://openalex.org/S2531583244","display_name":"Journal of Complex Networks","issn_l":"2051-1310","issn":["2051-1310","2051-1329"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Complex Networks","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/A5007021724","display_name":"Shlomi Maliah","orcid":null},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shlomi Maliah","raw_affiliation_strings":["Information Systems Engineering, Ben Gurion University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Systems Engineering, Ben Gurion University","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059447087","display_name":"Rami Puzis","orcid":"https://orcid.org/0000-0002-7229-3899"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Rami Puzis","raw_affiliation_strings":["Information Systems Engineering, Ben Gurion University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Systems Engineering, Ben Gurion University","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006317361","display_name":"Guy Shani","orcid":"https://orcid.org/0000-0003-4131-0382"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Guy Shani","raw_affiliation_strings":["Information Systems Engineering, Ben Gurion University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Systems Engineering, Ben Gurion University","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006317361"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.1827,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.42332415,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9930999875068665,"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/landmark","display_name":"Landmark","score":0.8492066860198975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6798916459083557},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5888270139694214},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5324802398681641},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5225474238395691},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5103904604911804},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49686673283576965},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.47613027691841125},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.37934380769729614},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3409656882286072},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22530540823936462},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15700528025627136},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14059969782829285},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.08531105518341064},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06532177329063416},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.056196749210357666}],"concepts":[{"id":"https://openalex.org/C2780297707","wikidata":"https://www.wikidata.org/wiki/Q4895393","display_name":"Landmark","level":2,"score":0.8492066860198975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6798916459083557},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5888270139694214},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5324802398681641},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5225474238395691},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5103904604911804},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49686673283576965},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.47613027691841125},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.37934380769729614},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3409656882286072},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22530540823936462},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15700528025627136},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14059969782829285},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.08531105518341064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06532177329063416},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.056196749210357666},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/comnet/cnx008","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comnet/cnx008","pdf_url":null,"source":{"id":"https://openalex.org/S2531583244","display_name":"Journal of Complex Networks","issn_l":"2051-1310","issn":["2051-1310","2051-1329"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Complex Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W160678529","https://openalex.org/W229097380","https://openalex.org/W1512819151","https://openalex.org/W1790404493","https://openalex.org/W1982184342","https://openalex.org/W2005945380","https://openalex.org/W2014889099","https://openalex.org/W2035601288","https://openalex.org/W2040956707","https://openalex.org/W2052703084","https://openalex.org/W2055438560","https://openalex.org/W2056403031","https://openalex.org/W2075364600","https://openalex.org/W2076572897","https://openalex.org/W2088961699","https://openalex.org/W2089370556","https://openalex.org/W2098636939","https://openalex.org/W2112964526","https://openalex.org/W2140271346","https://openalex.org/W2154768509","https://openalex.org/W2159394589","https://openalex.org/W2163316275","https://openalex.org/W2169528473","https://openalex.org/W2172107427","https://openalex.org/W2500139799"],"related_works":["https://openalex.org/W1513544537","https://openalex.org/W2015463369","https://openalex.org/W200128031","https://openalex.org/W2949266994","https://openalex.org/W3125562287","https://openalex.org/W1978969308","https://openalex.org/W2009877374","https://openalex.org/W2362790552","https://openalex.org/W2026003143","https://openalex.org/W2062438488"],"abstract_inverted_index":{"Computing":[0],"the":[1,27,33,66,70,78,82,89,92,104,125,150,158,179,191,194,200],"distance":[2,47,57,71,139,167],"between":[3,72],"vertices":[4,61,75],"in":[5,14],"a":[6,50,85,99,110,121,131,171],"large":[7],"dynamic":[8,30],"network":[9,28],"is":[10,22,62,135],"an":[11,144],"important":[12],"task":[13],"many":[15],"real-time":[16,20],"applications.":[17],"An":[18],"exact":[19],"computation":[21],"often":[23],"infeasible,":[24],"due":[25],"to":[26,41,84,91,155,190,207],"size,":[29],"changes":[31],"and":[32,87,160,181,187],"requirement":[34],"for":[35,46,102],"rapid":[36],"response.":[37],"We":[38,142,176],"hence":[39],"revert":[40],"estimates.":[42],"One":[43],"popular":[44],"method":[45,101,154,206],"estimation":[48,123,140,168],"uses":[49],"set":[51,105,112,146,173],"of":[52,106,113,124,127,147,157,174,184,193,202],"vertices,":[53],"called":[54],"landmarks,":[55,107,203],"whose":[56],"from":[58,81,88],"all":[59],"other":[60,210],"computed":[63,79],"offline.":[64],"Then,":[65],"online":[67],"query":[68],"estimates":[69],"two":[73],"arbitrary":[74],"by":[76],"summing":[77],"distances":[80],"source":[83],"landmark":[86,90],"target.":[93],"In":[94],"this":[95],"paper":[96],"we":[97],"suggest":[98],"new":[100],"computing":[103],"based":[108],"on":[109,170],"sampled":[111,195],"shortest":[114,128],"path":[115],"trees":[116],"(SPTs).":[117],"The":[118],"SPTs":[119,153],"provide":[120,143],"good":[122],"number":[126,192,201],"paths":[129],"that":[130,162],"vertex":[132],"covers,":[133],"which":[134],"strongly":[136],"correlated":[137],"with":[138],"error.":[141],"extensive":[145],"experiments,":[148],"comparing":[149],"proposed":[151],"Sampled":[152],"state":[156],"art,":[159],"show":[161],"our":[163,185,205],"approach":[164],"provides":[165],"lower":[166],"errors":[169],"wide":[172],"benchmarks.":[175],"further":[177],"analyse":[178],"time":[180],"space":[182],"complexities":[183],"method,":[186],"its":[188],"sensitivity":[189],"SPTs,":[196],"as":[197,199],"well":[198],"showing":[204],"consistently":[208],"outperforms":[209],"approaches.":[211]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}