Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.
and Peters, Joseph G
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Two new approximation algorithms for SW-TVC on always-star temporal graphs achieve 2Δ-1 and Δ-1 ratios in O(T) and O(TmΔ²) time respectively, with exact solutions for small Δ.
citing papers explorer
-
Maximizing Reachability via Shifting of Temporal Paths
Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.
-
New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
Two new approximation algorithms for SW-TVC on always-star temporal graphs achieve 2Δ-1 and Δ-1 ratios in O(T) and O(TmΔ²) time respectively, with exact solutions for small Δ.