The paper defines the DelayBetter problem in temporal graphs, gives polynomial algorithms for fixed-route and tree cases, gives an FPT algorithm parameterized by feedback edge set and passengers, and proves NP-completeness for lifetime-2 and planar cases.
Title resolution pending
1 Pith paper cite this work, alongside 11 external citations. Polarity classification is still indexing.
1
Pith paper citing it
11
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs
The paper defines the DelayBetter problem in temporal graphs, gives polynomial algorithms for fixed-route and tree cases, gives an FPT algorithm parameterized by feedback edge set and passengers, and proves NP-completeness for lifetime-2 and planar cases.