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 Δ.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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 Δ.