11 citations · 11 across the 3 of their papers we have counts for
3 papers
K-Shortest Simple Paths Using Biobjective Path Search
Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer +1
In this paper we introduce a new algorithm for the \emph{-Shortest Simple Paths} (\kspp{k}) problem with an asymptotic running time matching the state of the art from the litera…
New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem
Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer
The Multiobjective Minimum Spanning Tree (MO-MST) problem is a variant of the Minimum Spanning Tree problem, in which the costs associated with every edge of the input graph are ve…
Targeted Multiobjective Dijkstra Algorithm
Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño-Noda +1
In this paper, we introduce the Targeted Multiobjective Dijkstra Algorithm (T-MDA), a label setting algorithm for the One-to-One Multiobjective Shortest Path (MOSP) Problem. The T-…