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.
SIAM Journal on Computing , volume =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2verdicts
UNVERDICTED 2representative citing papers
Presents a linear-time (1.5-ε)-approximation algorithm for the broadcast time problem on k-cycle graphs.
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.
-
A Linear-Time 1.5-Approximation for Broadcasting in k-Cycle Graphs
Presents a linear-time (1.5-ε)-approximation algorithm for the broadcast time problem on k-cycle graphs.