Introduces TIM width generalizing VIM width and gives meta-algorithms that characterize FPT problems including temporal Hamiltonian path and dominating set.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
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.
d-MinIntSep is NP-hard and inapproximable to within a logarithmic factor; an ILP formulation computes minimum interval separators and is tested on synthetic and real transportation temporal networks.
citing papers explorer
-
Families of tractable problems with respect to vertex-interval-membership width and its generalisations
Introduces TIM width generalizing VIM width and gives meta-algorithms that characterize FPT problems including temporal Hamiltonian path and dominating set.
-
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.
-
Testing Robustness of Temporal Transportation Networks via Interval Separators
d-MinIntSep is NP-hard and inapproximable to within a logarithmic factor; an ILP formulation computes minimum interval separators and is tested on synthetic and real transportation temporal networks.