Jun 11, 2024 · We seek to find short paths in which the number of occurrences of each color is within some given lower and upper bounds.

Mar 31, 2022 · 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 ...

Once the whole table is computed, we can check whether there is a balance-fair shortest s-t-path in G by checking whether T[t, 0, 0,..., 0] is set to true.

Oct 14, 2022 · We study the parameterized complexity of finding shortest s-t-paths with an additional fairness requirement.

Feb 27, 2023 · Our study provides insight into a very general fairness model injected into the problem of finding short paths in graphs. We indicate that ...

Missing: Short | Show results with:Short

Jun 1, 2024 · We study the parameterized complexity of finding shortest s-t-paths with an additional fairness requirement. The task is to compute a shortest ...

Feb 7, 2023 · 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 ...

We study the parameterized complexity of finding shortest s-t-paths with an additional fairness requirement. The task is to compute a shortest path in a ...

We study the parameterized complexity of finding shortest s-t-paths with an additional fairness requirement. The task is to compute a shortest path in a ...