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.
https://zbir.deutschebahn.com/2024/en/interim-group-management-report-unaudited/product-quality-and-digitalization/punctuality/
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
REJECT 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.