On the Universal Near-Shortest Simple Paths Problem

06/12/2019
by   Luca E. Schäfer, et al.
0

This article generalizes the Near-Shortest Paths Problem introduced by Byers and Waterman in 1984 using concepts of the Universal Shortest Path Problem established by Turner and Hamacher in 2011. The generalization covers a variety of shortest path problems by introducing a universal weight vector. We apply this concept to the Near-Shortest Paths Problem in a way that we are able to enumerate all universal near-shortest simple paths. Therefore, we present a recursive algorithm to compute the set of universal near-shortest simple paths between two prespecified nodes and evaluate the running time complexity per path enumerated with respect to different values of the universal weight vector. Further, we study the cardinality of a minimal complete set with respect to different values of the universal weight vector.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/19/2023

K-Shortest Simple Paths Using Biobjective Path Search

In this paper we introduce a new algorithm for the k-Shortest Simple Pat...
research
04/17/2020

The two player shortest path network interdiction problem

In this article, we study a biobjective extension of the shortest path n...
research
04/08/2022

Finding shortest and nearly shortest path nodes in large substantially incomplete networks

Dynamic processes on networks, be it information transfer in the Interne...
research
06/15/2022

Finding Control Synthesis for Kinematic Shortest Paths

This work presents the analysis of the properties of the shortest path c...
research
04/10/2018

Universal features of mountain ridge patterns on Earth

We study structure of the mountain ridge systems based on the empirical ...
research
03/15/2023

Shortest Paths in Portalgons

Any surface that is intrinsically polyhedral can be represented by a col...
research
05/01/2023

Temporal Betweenness Centrality on Shortest Paths Variants

Betweenness centrality has been extensively studied since its introducti...

Please sign up or login with your details

Forgot password? Click here to reset