Research has shown that the Temporal Vertex Cover problem, which seeks to cover all edges in a temporal graph with the minimum number of vertices, is NP-hard even in simple structures like paths ...