{"id":"https://openalex.org/W7165746419","doi":"https://doi.org/10.4230/lipics.sand.2026.17","title":"Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem","display_name":"Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7165746419","doi":"https://doi.org/10.4230/lipics.sand.2026.17"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26251","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.17","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.17/LIPIcs.SAND.2026.17.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.17/LIPIcs.SAND.2026.17.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5106591685","display_name":"Edina Marica","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marica, Edina","raw_affiliation_strings":["Campus Straubing for Biotechnology and Sustainability, Technical University of Munich, Straubing, Germany"],"raw_orcid":"https://orcid.org/0009-0003-0594-000X","affiliations":[{"raw_affiliation_string":"Campus Straubing for Biotechnology and Sustainability, Technical University of Munich, Straubing, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050306276","display_name":"Clemens Thielen","orcid":"https://orcid.org/0000-0003-0897-3571"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thielen, Clemens","raw_affiliation_strings":["Campus Straubing for Biotechnology and Sustainability, Technical University of Munich, Straubing, Germany"],"raw_orcid":"https://orcid.org/0000-0003-0897-3571","affiliations":[{"raw_affiliation_string":"Campus Straubing for Biotechnology and Sustainability, Technical University of Munich, Straubing, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5135418536","display_name":"Alina Wittmann","orcid":"https://orcid.org/0009-0001-1314-0198"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Wittmann, Alina","raw_affiliation_strings":["Campus Straubing for Biotechnology and Sustainability, Technical University of Munich, Straubing, Germany"],"raw_orcid":"https://orcid.org/0009-0001-1314-0198","affiliations":[{"raw_affiliation_string":"Campus Straubing for Biotechnology and Sustainability, Technical University of Munich, Straubing, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.66094033,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.20180000364780426,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.20180000364780426,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.08370000123977661,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0820000022649765,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7716000080108643},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.6886000037193298},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5425000190734863},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47920000553131104},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4715000092983246},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4494999945163727},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43380001187324524},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4207000136375427}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7716000080108643},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.6886000037193298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.617900013923645},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5425000190734863},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.541100025177002},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47920000553131104},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4715000092983246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4629000127315521},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43380001187324524},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4207000136375427},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.36160001158714294},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.3610999882221222},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.3508000075817108},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.31790000200271606},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.28450000286102295},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2809000015258789},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27059999108314514},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2703000009059906},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.2648000121116638},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25920000672340393},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.25699999928474426}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26251","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.17","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.17/LIPIcs.SAND.2026.17.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.17","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sand.2026.17","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:26251","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.17","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.17/LIPIcs.SAND.2026.17.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/G1432464712","display_name":"Approximation von multiparametrischen Optimierungsproblemen","funder_award_id":"508981269","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"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7165746419.pdf","grobid_xml":"https://content.openalex.org/works/W7165746419.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,9,44,157,163,198],"directed,":[2],"discrete-time":[3],"temporal":[4,23,40,134],"graph":[5],"G":[6],"=":[7],"(V,R),":[8],"start":[10],"node":[11],"s":[12],"\u2208":[13,31],"V,":[14,32],"and":[15,67,171,190],"p":[16],"\u2265":[17],"1":[18],"objectives,":[19],"the":[20,34,65,71,80,94,97,110,118,154,205],"single-source":[21],"multiobjective":[22],"shortest":[24,84],"path":[25,47,85,166],"problem":[26,59,86,119,159],"asks,":[27],"for":[28,33,48,57,79,187],"each":[29,49],"v":[30],"set":[35],"of":[36,39,64,96,100,145,156],"nondominated":[37,150,209],"images":[38],"s-v-paths":[41],"together":[42],"with":[43],"corresponding":[45],"efficient":[46],"image.":[50],"A":[51,125],"recent":[52],"general":[53,183],"label":[54,76,184],"setting":[55,77,130,189],"algorithm":[56],"this":[58,114,129,188],"relies":[60],"on":[61,87],"two":[62,101],"properties":[63],"objectives-monotonicity":[66],"isotonicity.":[68,124],"Monotonicity":[69],"generalizes":[70],"nonnegativity":[72],"assumption":[73],"required":[74],"by":[75,109],"methods":[78],"classical":[81],"additive":[82],"single-objective":[83],"static":[88],"graphs,":[89],"while":[90],"isotonicity":[91],"ensures":[92],"that":[93,132,204],"order":[95],"objective":[98],"values":[99],"paths":[102,173],"is":[103,131,169,200],"preserved":[104],"when":[105],"both":[106],"are":[107,179],"extended":[108],"same":[111],"arc.":[112],"In":[113],"paper,":[115],"we":[116],"study":[117,155],"without":[120],"assuming":[121],"monotonicity":[122],"and/or":[123],"key":[126],"difficulty":[127],"in":[128,161],"zero-duration":[133],"cycles":[135],"may":[136],"need":[137],"to":[138,147],"be":[139],"traversed":[140],"an":[141],"arbitrary":[142],"finite":[143],"number":[144],"times":[146],"generate":[148],"all":[149,208],"images.":[151,210],"This":[152],"motivates":[153],"restricted":[158],"variant":[160],"which":[162,196],"maximum":[164],"admissible":[165],"length":[167],"K":[168,177],"imposed,":[170],"only":[172],"containing":[174],"at":[175],"most":[176],"arcs":[178],"considered.":[180],"We":[181],"develop":[182],"correcting":[185],"algorithms":[186,206],"establish":[191],"several":[192],"sufficient":[193],"conditions":[194],"under":[195],"such":[197],"bound":[199],"not":[201],"required,":[202],"implying":[203],"compute":[207]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2026-06-25T00:00:00"}