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 Δ.
30 Silvio Micali and Vijay V
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative 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 Δ.