atlas

Research map / Graph learning / Graph algorithms and clustering

Fair Short Paths in Vertex-Colored Graphs

AAAI 2023 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Encode color lower and upper bounds as a matroid and use representative familiesSPLU · General SPLU, parameterized by path lengthrunning time: 5.181^{\ell} \log (1/\varepsilon) n^{\mathcal{O}(1)}Helped
Track color-count tuples in dynamic programmingSPLU on shortest paths · Shortest-path SPLU (\ell = \dist(s,t))running time: \mathcal{O}(n^{c}\cdot m)Helped
Require the path to be shortest rather than allowing any pathFair path finding · Two-color fairness constraintscomputational complexity: NP-hardMixed
Allow zero-length arcsBSP · Two colorscomputational complexity: NP-hardHurt
Use general lower-bound constraints that permit detoursSPLU · Unit arc lengths and one colorcomputational complexity: NP-hardHurt
Parameterize BSP by the number of colorsBSP · Balance-fair shortest pathsparameterized complexity: \W{1}-hardHurt
Seek a general fair path with a short path-length boundSPLU · General SPLUfixed-parameter tractability: 5.181^{\ell} \log (1/\varepsilon) n^{\mathcal{O}(1)}Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy