在时序图中优化多广播的距离
Optimizing Distances for Multi-Broadcast in Temporal Graphs
AI总结:
在时序图中,通过优化多广播的最坏时间距离,解决多源信息传播的调度问题。
摘要:
时序图表示的是连接随时间变化的网络,边只在特定时刻可用。受物流、多智能体信息传播和无线网络等应用的启发,我们引入了D-时序多广播(D-TMB)问题,该问题要求调度边的可用性,使得预定的源集能够到达所有其他顶点,同时优化任意源的最坏情况时间距离D。我们证明D-TMB推广了ReachFast(arXiv:2112.08797)。然后我们对D-TMB在六个定义的时间距离D下进行了计算复杂性和近似性的分析,即最早到达(EA)、最晚出发(LD)、最快时间(FT)、最短旅行(ST)、最小跳数(MH)和最小等待(MW)。对于单个源,我们证明对于EA和LD,D-TMB可以在多项式时间内解决,而对于其他时间距离,它则是NP难的且难以近似。我们为FT和MW给出了近似算法。对于多个源,如果事先不假设可行性,则问题在P≠NP的情况下无法近似,即使只有两个源。我们通过识别结构性条件来补充这一负面结果,这些条件保证了对于EA和LD,无论源的数量如何,问题都是可处理的。
英文摘要:
Temporal graphs represent networks in which connections change over time, with edges available only at specific moments. Motivated by applications in logistics, multi-agent information spreading, and wireless networks, we introduce the D-Temporal Multi-Broadcast (D-TMB) problem, which asks for scheduling the availability of edges so that a predetermined subset of sources reach all other vertices while optimizing the worst-case temporal distance D from any source. We show that D-TMB generalizes ReachFast (arXiv:2112.08797). We then characterize the computational complexity and approximability of D-TMB under six definitions of temporal distance D, namely Earliest-Arrival (EA), Latest-Departure (LD), Fastest-Time (FT), Shortest-Traveling (ST), Minimum-Hop (MH), and Minimum-Waiting (MW). For a single source, we show that D-TMB can be solved in polynomial time for EA and LD, while for the other temporal distances it is NP-hard and hard to approximate within a factor that depends on the adopted distance function. We give approximation algorithms for FT and MW. For multiple sources, if feasibility is not assumed a priori, the problem is inapproximable within any factor unless P = NP, even with just two sources. We complement this negative result by identifying structural conditions that guarantee tractability for EA and LD for any number of sources.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。