3 citations · 3 across the 1 of their papers we have counts for
1 paper · 1 filter
Aleksa Stanković
We study the Minimum Sum Vertex Cover problem, which asks for an ordering of vertices in a graph that minimizes the total cover time of edges. In particular, n vertices of the grap…