Scheduling Maintenance Jobs in Networks

ALGORITHMS AND COMPLEXITY (CIAC 2017)(2019)

引用 9|浏览52
暂无评分
摘要
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.
更多
查看译文
关键词
Scheduling,Maintenance,Connectivity,Complexity theory,Approximation algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要