{"id":"https://openalex.org/W7165754613","doi":"https://doi.org/10.4230/lipics.sand.2026.19","title":"Minimize the Sum of Waiting Times in Periodic Temporal Trees","display_name":"Minimize the Sum of Waiting Times in Periodic Temporal Trees","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7165754613","doi":"https://doi.org/10.4230/lipics.sand.2026.19"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26253","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.19/LIPIcs.SAND.2026.19.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.19/LIPIcs.SAND.2026.19.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139245561","display_name":"Julia Meusel","orcid":"https://orcid.org/0009-0001-2880-1390"},"institutions":[{"id":"https://openalex.org/I68956291","display_name":"Martin Luther University Halle-Wittenberg","ror":"https://ror.org/05gqaka33","country_code":"DE","type":"education","lineage":["https://openalex.org/I68956291"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Meusel, Julia","raw_affiliation_strings":["Martin Luther University Halle-Wittenberg, Germany"],"raw_orcid":"https://orcid.org/0009-0001-2880-1390","affiliations":[{"raw_affiliation_string":"Martin Luther University Halle-Wittenberg, Germany","institution_ids":["https://openalex.org/I68956291"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045950235","display_name":"Nils Morawietz","orcid":"https://orcid.org/0000-0002-7283-4982"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE","FR"],"is_corresponding":false,"raw_author_name":"Morawietz, Nils","raw_affiliation_strings":["LaBRI, Universit\u00e9 de Bordeaux, Talence, France","Institute of Computer Science, Friedrich Schiller University Jena, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7283-4982","affiliations":[{"raw_affiliation_string":"LaBRI, Universit\u00e9 de Bordeaux, Talence, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]},{"raw_affiliation_string":"Institute of Computer Science, Friedrich Schiller University Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006211424","display_name":"Matthias M\u00fcller\u2010Hannemann","orcid":"https://orcid.org/0000-0001-6976-0006"},"institutions":[{"id":"https://openalex.org/I68956291","display_name":"Martin Luther University Halle-Wittenberg","ror":"https://ror.org/05gqaka33","country_code":"DE","type":"education","lineage":["https://openalex.org/I68956291"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M\u00fcller-Hannemann, Matthias","raw_affiliation_strings":["Martin Luther University Halle-Wittenberg, Germany"],"raw_orcid":"https://orcid.org/0000-0001-6976-0006","affiliations":[{"raw_affiliation_string":"Martin Luther University Halle-Wittenberg, Germany","institution_ids":["https://openalex.org/I68956291"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079358721","display_name":"K Reinhardt","orcid":null},"institutions":[{"id":"https://openalex.org/I68956291","display_name":"Martin Luther University Halle-Wittenberg","ror":"https://ror.org/05gqaka33","country_code":"DE","type":"education","lineage":["https://openalex.org/I68956291"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Reinhardt, Klaus","raw_affiliation_strings":["Martin Luther University Halle-Wittenberg, Germany"],"raw_orcid":"https://orcid.org/0009-0002-7002-4051","affiliations":[{"raw_affiliation_string":"Martin Luther University Halle-Wittenberg, Germany","institution_ids":["https://openalex.org/I68956291"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.66523238,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.7702999711036682,"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.7702999711036682,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.06880000233650208,"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/T11106","display_name":"Data Management and Algorithms","score":0.026000000536441803,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5311999917030334},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48240000009536743},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4641000032424927},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4066999852657318},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.37279999256134033},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.3693999946117401},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.36730000376701355},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3652999997138977}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6482999920845032},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5475999712944031},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5311999917030334},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48240000009536743},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4641000032424927},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4066999852657318},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.37279999256134033},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3725999891757965},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.3693999946117401},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.36730000376701355},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3652999997138977},{"id":"https://openalex.org/C139002025","wikidata":"https://www.wikidata.org/wiki/Q3001212","display_name":"Lift (data mining)","level":2,"score":0.3499999940395355},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3418000042438507},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3366999924182892},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3131999969482422},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.29840001463890076},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.29820001125335693},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.29589998722076416},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.29089999198913574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2727999985218048},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.27239999175071716},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.26899999380111694},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2646999955177307}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26253","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.19/LIPIcs.SAND.2026.19.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.sand.2026.19","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sand.2026.19","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26253","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.19/LIPIcs.SAND.2026.19.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2465436510","display_name":"TEMPOral GRaph ALgorithms and problems","funder_award_id":"ANR-22-CE48-0001","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7165754613.pdf","grobid_xml":"https://content.openalex.org/works/W7165754613.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,80],"introduce":[1],"and":[2,65,76,110,114],"analyze":[3],"the":[4,20,36,54,68,71,125,153,160],"problem":[5,92,107,126,141],"of":[6,22,26,56,70,97,155,163],"finding":[7],"a":[8,57,90,95,137,169],"\u0394-labeling":[9],"\u03bb":[10],"for":[11,117,147,168],"an":[12,128,132,164],"undirected":[13],"tree":[14],"G":[15],"=":[16],"(V,E),":[17],"such":[18],"that":[19,82,100,106,124,130,134],"sum":[21],"overall":[23],"waiting":[24],"times":[25],"fastest":[27,58],"paths":[28],"between":[29,74],"all":[30],"vertex":[31],"pairs":[32],"is":[33,53,67,159],"minimized":[34],"in":[35,78,103,142],"\u0394-periodic":[37],"temporal":[38,59,170],"graph":[39,171],"(G,\u03bb).":[40],"That":[41],"is,":[42,131],"we":[43,108,122],"aim":[44],"to":[45,63,89,139],"minimize":[46],"\u2211_{(u,v)":[47],"\u2208":[48],"V\u00d7V}":[49],"(dur(u,v)-dist(u,v)),":[50],"where":[51],"dur(u,v)":[52],"duration":[55],"path":[60,73],"from":[61],"u":[62,75],"v":[64,77],"dist(u,v)":[66],"length":[69],"shortest":[72],"G.":[79],"show":[81,123],"this":[83,158],"objective":[84],"function":[85],"essentially":[86],"boils":[87],"down":[88],"known":[91],"about":[93],"partitioning":[94],"set":[96],"natural":[98],"numbers":[99],"has":[101],"applications":[102],"scheduling.":[104],"From":[105],"lift":[109],"adapt":[111],"several":[112],"upper":[113],"lower":[115],"bounds":[116],"our":[118,140,156],"problem.":[119,173],"For":[120],"example,":[121],"admits":[127],"EPTAS,":[129],"algorithm":[133,167],"can":[135],"compute":[136],"(1+\u03b5)-approximation":[138],"time":[143],"f(1/\u03b5)":[144],"\u22c5":[145],"n^\ud835\udcaa(1)":[146],"each":[148],"\u03b5":[149],">":[150],"0.":[151],"To":[152],"best":[154],"knowledge,":[157],"first":[161],"example":[162],"efficient":[165],"approximation":[166],"realization":[172]},"counts_by_year":[],"updated_date":"2026-08-23T07:36:19.812096","created_date":"2026-06-25T00:00:00"}