The problem of finding paths in temporal graphs has been recently considered due to its many applications. In this paper we consider a variant of the problem that, given a vertex-colored temporal graph, asks for a path whose vertices have distinct colors and include the maximum number of colors. We study the approximation complexity of the problem and we provide an inapproximability lower bound. Then we present a heuristic for the problem and an experimental evaluation of our heuristic, both on synthetic and real-world graphs.

中文翻译：

---

在时态图中寻找彩色路径

由于它的许多应用，最近已经考虑了在时间图中寻找路径的问题。在本文中，我们考虑问题的一个变体，给定一个顶点颜色的时间图，要求一条路径的顶点具有不同的颜色并包含最大数量的颜色。我们研究了问题的近似复杂度，并提供了一个不可逼近的下界。然后，我们针对该问题提出了一种启发式方法，并对我们的启发式方法进行了实验评估，包括合成图和现实世界图。