In this article we consider networks, which for a given time period can have one link broken. Which new link should we build so the closeness of the resulting network satisfies some optimal criteria? We consider different criteria for optimization and different graphs: cycle, paths, lollipop graphs, and two complete graphs, connected by a link.

翻译：本文考虑在给定时间段内可能存在一个链接断裂的网络。应构建哪条新链接，使得所得网络的紧密度满足某些最优准则？我们研究了不同的优化准则及各类图结构：环、路径、棒棒糖图，以及通过一条链接连接的两个完全图。