The structural complexity landscape of finding balance-fair shortest paths

Bentert, Matthias; Kellerhals, Leon; Niedermeier, Rolf

doi:10.1016/j.tcs.2022.08.023

Search citation statements

Order By: Relevance

Paper Sections

Select...

Discussion1

Balance-fair Shortest Path Input1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For parameterizing BALANCE-FAIR SHORT-EST PATH by the number c of colors, our results leave a gap between the running time upper bound of n O(c) and the lower bound of n o( c /log c) . In a follow-up work, we studied the parameterized complexity of BALANCE-FAIR SHORT-EST PATH with respect to structural parameterizations (Bentert, Kellerhals, and Niedermeier 2022b).…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Fair Short Paths in Vertex-Colored Graphs

Bentert

Kellerhals

Niedermeier

2023

AAAI

View full text Add to dashboard Cite

The computation of short paths in graphs with arc lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally valuable. For the setting where each vertex is assigned to a group (color), we provide a framework to model multiple natural fairness aspects. We seek to find short paths in which the number of occurrences of each color is within some given lower and upper bounds. Among other results, we prove the introduced problems to be computationally intractable (NP-hard and parameterized hard with respect to the number of colors) even in very restricted settings (such as each color should appear with exactly the same frequency), while also presenting an encouraging algorithmic result ("fixed-parameter tractability") related to the length of the sought solution path for the general problem.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Results marked with ⋆ are deferred to the full version (Bentert, Kellerhals, and Niedermeier 2022a).…”

Section: Balance-fair Shortest Path Inputmentioning

confidence: 99%