{"id":"https://openalex.org/W3091847779","doi":"https://doi.org/10.1007/s41109-020-00311-0","title":"Efficient computation of optimal temporal walks under waiting-time constraints","display_name":"Efficient computation of optimal temporal walks under waiting-time constraints","publication_year":2020,"publication_date":"2020-10-06","ids":{"openalex":"https://openalex.org/W3091847779","doi":"https://doi.org/10.1007/s41109-020-00311-0","mag":"3091847779"},"language":"en","primary_location":{"id":"doi:10.1007/s41109-020-00311-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41109-020-00311-0","pdf_url":"https://appliednetsci.springeropen.com/track/pdf/10.1007/s41109-020-00311-0","source":{"id":"https://openalex.org/S3035517252","display_name":"Applied Network Science","issn_l":"2364-8228","issn":["2364-8228"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Network Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://appliednetsci.springeropen.com/track/pdf/10.1007/s41109-020-00311-0","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086072107","display_name":"Matthias Bentert","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Matthias Bentert","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Faculty IV, Algorithmics and Computational Complexity, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Faculty IV, Algorithmics and Computational Complexity, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011224204","display_name":"Anne-Sophie Himmel","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Anne-Sophie Himmel","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Faculty IV, Algorithmics and Computational Complexity, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Faculty IV, Algorithmics and Computational Complexity, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012560459","display_name":"Andr\u00e9 Nichterlein","orcid":"https://orcid.org/0000-0001-7451-9401"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Nichterlein","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Faculty IV, Algorithmics and Computational Complexity, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Faculty IV, Algorithmics and Computational Complexity, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033021388","display_name":"Rolf Niedermeier","orcid":"https://orcid.org/0000-0003-1703-1236"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Niedermeier","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Faculty IV, Algorithmics and Computational Complexity, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Faculty IV, Algorithmics and Computational Complexity, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086072107"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":{"value":1390,"currency":"USD","value_usd":1390},"apc_paid":{"value":974,"currency":"EUR","value_usd":1050},"fwci":3.354,"has_fulltext":true,"cited_by_count":42,"citation_normalized_percentile":{"value":0.92433007,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"5","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9997000098228455,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9997000098228455,"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/T11478","display_name":"Caching and Content Delivery","score":0.9965000152587891,"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/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6486738920211792},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5229262113571167},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.5070359706878662},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49552643299102783},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4909262955188751},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4532528817653656},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43369781970977783},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3923579752445221},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3725596070289612},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37248873710632324},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2855585217475891},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2555137872695923}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6486738920211792},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5229262113571167},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.5070359706878662},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49552643299102783},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4909262955188751},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4532528817653656},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43369781970977783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3923579752445221},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3725596070289612},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37248873710632324},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2855585217475891},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2555137872695923},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s41109-020-00311-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41109-020-00311-0","pdf_url":"https://appliednetsci.springeropen.com/track/pdf/10.1007/s41109-020-00311-0","source":{"id":"https://openalex.org/S3035517252","display_name":"Applied Network Science","issn_l":"2364-8228","issn":["2364-8228"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Network Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:116ed47d2ac14f05a48cc8dbe4f37f2f","is_oa":true,"landing_page_url":"https://doaj.org/article/116ed47d2ac14f05a48cc8dbe4f37f2f","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Applied Network Science, Vol 5, Iss 1, Pp 1-26 (2020)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s41109-020-00311-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41109-020-00311-0","pdf_url":"https://appliednetsci.springeropen.com/track/pdf/10.1007/s41109-020-00311-0","source":{"id":"https://openalex.org/S3035517252","display_name":"Applied Network Science","issn_l":"2364-8228","issn":["2364-8228"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Network Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8904030062","display_name":null,"funder_award_id":"NI 369/16","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320324094","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3091847779.pdf","grobid_xml":"https://content.openalex.org/works/W3091847779.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W204109380","https://openalex.org/W1593360408","https://openalex.org/W1746637951","https://openalex.org/W1874858905","https://openalex.org/W1937334562","https://openalex.org/W1977545325","https://openalex.org/W1984196269","https://openalex.org/W1985718595","https://openalex.org/W2082195599","https://openalex.org/W2104317982","https://openalex.org/W2131499531","https://openalex.org/W2149769615","https://openalex.org/W2156537685","https://openalex.org/W2169455356","https://openalex.org/W2327974553","https://openalex.org/W2346708467","https://openalex.org/W2498592833","https://openalex.org/W2584641794","https://openalex.org/W2735320078","https://openalex.org/W2755088640","https://openalex.org/W2767544505","https://openalex.org/W2799158821","https://openalex.org/W2835349798","https://openalex.org/W2921749793","https://openalex.org/W2962819912","https://openalex.org/W2963405399","https://openalex.org/W2963681731","https://openalex.org/W2964299995","https://openalex.org/W2968468046","https://openalex.org/W2971692958","https://openalex.org/W2973017021","https://openalex.org/W3005658287","https://openalex.org/W3037819556","https://openalex.org/W3080255537","https://openalex.org/W3102446989","https://openalex.org/W3102945079","https://openalex.org/W3109089857","https://openalex.org/W3199947862","https://openalex.org/W4235019172","https://openalex.org/W4237347223","https://openalex.org/W4251085314"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2089134982","https://openalex.org/W3100139999","https://openalex.org/W2113270940","https://openalex.org/W4252842032","https://openalex.org/W2900627138"],"abstract_inverted_index":{"Abstract":[0],"Node":[1],"connectivity":[2],"plays":[3],"a":[4,13,45,156,186],"central":[5,120],"role":[6],"in":[7,21,91,152,177],"temporal":[8,22,41],"network":[9],"analysis.":[10],"We":[11],"provide":[12,67],"broad":[14],"study":[15],"of":[16,19,48,59,87,108,117,155,189],"various":[17,80],"concepts":[18],"walks":[20,73,171],"graphs,":[23],"that":[24,74,129,143,172,196],"is,":[25,144],"graphs":[26],"with":[27,79,185],"fixed":[28],"vertex":[29],"sets":[30,33],"but":[31],"arc":[32],"changing":[34],"over":[35],"time.":[36],"Taking":[37],"into":[38],"account":[39],"the":[40,106,115,145,206],"aspect":[42],"leads":[43],"to":[44,77,123,168,211],"rich":[46],"set":[47,188],"optimization":[49,81,190],"criteria":[50,82],"for":[51,70,141,170],"\u201cshortest\u201d":[52],"walks.":[53],"Extending":[54],"and":[55,83,110,147,181],"broadening":[56],"state-of-the-art":[57],"work":[58,127],"Wu":[60,124,161,212],"et":[61,125,162,213],"al.":[62,163],"[IEEE":[63],"TKDE":[64],"2016],":[65],"we":[66],"an":[68],"algorithm":[69,165],"computing":[71],"shortest":[72],"is":[75,105,114,128],"capable":[76],"deal":[78,184],"any":[84],"linear":[85],"combination":[86],"these.":[88],"It":[89],"runs":[90],"O":[92],"(|":[93],"V":[94,103],"|+|":[95],"E":[96,98,112],"|log|":[97],"|)":[99],"time":[100,150,179,208],"where":[101],"|":[102,104,111,113],"number":[107,116],"vertices":[109,154],"time-arcs.":[118],"A":[119],"distinguishing":[121],"factor":[122],"al.\u2019s":[126,214],"our":[130,164,197],"model":[131],"allows":[132,167],"to,":[133],"motivated":[134],"by":[135],"real-world":[136],"applications,":[137],"respect":[138],"waiting-time":[139],"constraints":[140],"vertices,":[142],"minimum":[146],"maximum":[148],"waiting":[149],"allowed":[151],"intermediate":[153],"walk.":[157],"Moreover,":[158],"other":[159],"than":[160],"also":[166],"search":[169],"pass":[173],"multiple":[174],"subsequent":[175],"time-arcs":[176],"one":[178],"step,":[180],"it":[182],"can":[183,200],"richer":[187,198],"criteria.":[191],"Our":[192],"experimental":[193],"studies":[194],"indicate":[195],"modeling":[199],"be":[201],"achieved":[202],"without":[203],"significantly":[204],"worsening":[205],"running":[207],"when":[209],"compared":[210],"algorithms.":[215]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}