For example, a novel 0.8785-approximation algorithm for high-dimensional table compression on balanced k-partite graphs leverages semidefinite programming to achieve near-optimal performance ...

These temporal algorithms are particularly relevant for applications in rapidly changing environments, as they enable the identification of influential nodes in time-varying networks [3].