2026-07-21T14:10:58Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13147 2024-03-06T10:31:08Z ddc:004 open_access

Framing Algorithms for Approximate Multicriteria Shortest Paths Hanusse, Nicolas Ilcinkas, David Lentz, Antonin Pareto set multicriteria shortest paths approximation This paper deals with the computation of d-dimensional multicriteria shortest paths. In a weighted graph with arc weights represented by vectors, the cost of a path is the vector sum of the weights of its arcs. For a given pair consisting of a source s and a destination t, a path P dominates a path Q if and only if P’s cost is component-wise smaller than or equal to Q’s cost. The set of Pareto paths, or Pareto set, from s to t is the set of paths that are not dominated. The computation time of the Pareto paths can be prohibitive whenever the set of Pareto paths is large. We propose in this article new algorithms to compute approximated Pareto paths in any dimension. For d = 2, we exhibit the first approximation algorithm, called Frame, whose output is guaranteed to be always a subset of the Pareto set. Finally, we provide a small experimental study in order to confirm the relevance of our Frame algorithm. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Nicolas Hanusse and David Ilcinkas and Antonin Lentz 2020 Is Part Of OASIcs, Volume 85, 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2020.11 urn:nbn:de:0030-drops-131476 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2020.11 eng https://creativecommons.org/licenses/by/3.0/legalcode