Finding Balance-Fair Short Paths in Graphs

by   Matthias Bentert, et al.

The computation of short paths in graphs with edge lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally valuable. We contribute to a broader view on path finding by injecting a natural fairness aspect. Our fairness notion relates to vertex-colored graphs. Herein, we seek to find short paths in which all colors should appear with roughly the same frequency. Among other results, we prove the introduced problems to be computationally intractable (NP-hard and parameterized hard with respect to the number of colors), while also presenting an encouraging algorithmic result ("fixed-parameter tractability") related to the length of the sought solution path.


page 1

page 2

page 3

page 4


Restless Temporal Path Parameterized Above Lower Bounds

Reachability questions are one of the most fundamental algorithmic primi...

Multistage s-t Path: Confronting Similarity with Dissimilarity

Addressing a quest by Gupta et al. [ICALP'14], we provide a first, compr...

The Complexity of Packing Edge-Disjoint Paths

We introduce and study the complexity of Path Packing. Given a graph G a...

Finding Colorful Paths in Temporal Graphs

The problem of finding paths in temporal graphs has been recently consid...

Finding temporal patterns using algebraic fingerprints

In this paper we study a family of pattern-detection problems in vertex-...

The Complexity of Finding Fair Many-to-One Matchings

We analyze the (parameterized) computational complexity of "fair" varian...

Parameterized Algorithms for Diverse Multistage Problems

The world is rarely static – many problems need not only be solved once ...