（特殊类）图上运动问题的精确与近似算法
Exact and approximate algorithms for movement problems on (special classes of) graphs
摘要：
当对象的大集合（例如，机器人、传感器等）必须部署在给定的环境中，通常需要规划对象从其初始位置到享有某种全局属性的最终配置的协调运动。在这种情况下，最小化行进距离的某些函数以及因此能量消耗的问题是至关重要的。在本文中，我们研究了几个运动规划问题时，出现的对象必须在一个图形上移动，以达到某些目标，这是几个网络应用程序的兴趣。其中，这些目标包括广播信息和形成连接或无干扰的网络。我们研究这些问题的目的是最大限度地减少一些自然的措施，如平均/总的旅行距离，最大的旅行距离，或需要移动的对象的数量。在这方面，我们给出了几个可逼近性和不可逼近性的结果，其中大部分是紧的。
英文摘要：
When a large collection of objects (e.g., robots, sensors, etc.) has to be deployed in a given environment, it is often required to plan a coordinated motion of the objects from their initial position to a final configuration enjoying some global property. In such a scenario, the problem of minimizing some function of the distance travelled, and therefore energy consumption, is of vital importance. In this paper we study several motion planning problems that arise when the objects must be moved on a graph, in order to reach certain goals which are of interest for several network applications. Among the others, these goals include broadcasting messages and forming connected or interference-free networks. We study these problems with the aim of minimizing a number of natural measures such as the average/overall distance travelled, the maximum distance travelled, or the number of objects that need to be moved. To this respect, we provide several approximability and inapproximability results, most of which are tight.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
