arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1701.08809cs.DS
收藏

网络中维护作业的调度

Scheduling Maintenance Jobs in Networks

Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke

摘要:

我们调查的问题,调度维护的边缘在网络中,动机的目标,最大限度地减少交通或电信网络中断。我们专注于保持两个节点之间的连接随着时间的推移,对于路径网络的特殊情况下,这是有关的问题,最大限度地减少机器的繁忙时间。我们证明了在任意网络中,如果允许抢占,该问题可以在多项式时间内得到解决。如果抢占限制在整数时间点,问题是NP-难的,在非抢占的情况下,我们给出了强的非逼近性结果。此外,我们还给出了抢占能力的严格界,即非抢占最优解和抢占最优解的最大比值。有趣的是,抢占式和非抢占式的问题可以有效地解决路径,而我们表明,混合两者导致一个弱NP-困难的问题,允许一个简单的2-近似。

英文摘要:

We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time; for the special case of path networks, this is related to the problem of minimizing the busy time of machines. We show that the problem can be solved in polynomial time in arbitrary networks if preemption is allowed. If preemption is restricted to integral time points, the problem is NP-hard and in the non-preemptive case we give strong non-approximability results. Furthermore, we give tight bounds on the power of preemption, that is, the maximum ratio of the values of non-preemptive and preemptive optimal solutions. Interestingly, the preemptive and the non-preemptive problem can be solved efficiently on paths, whereas we show that mixing both leads to a weakly NP-hard problem that allows for a simple 2-approximation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑