连通性约束下的时态网络优化
Temporal Network Optimization Subject to Connectivity Constraints
摘要:
在这项工作中,我们考虑\emph{temporal networks},即由一个\emph{labeling} $λ$定义的网络分配给一个\emph{underlying graph} $G$的每个边缘的一组\emph{discrete}时间标签。边的标签是自然数,表示边可用的离散时刻。本文主要研究时态网络的\emph{path problems}。特别是,我们认为\emph{time-respecting}路径,即路径的边缘分配的$λ$严格递增序列的标签。首先,我们给出了两个有效的算法计算最短的时间尊重路径的时间网络。然后,我们证明了有一个\emph{natural analogue of Menger's theorem}举行的任意时间网络。最后,我们提出了两个\emph{cost minimization parameters}的时间网络设计。一个是$G$的\emph{temporality},其目标是最小化边的最大标签数,另一个是$G$的\emph{temporal cost},其目标是最小化使用的标签总数。根据某些\emph{connectivity constraint}进行这些参数的优化。我们证明了一些非常基本的图形家庭,如环,有向无环图,树的时间性和时间成本的几个下限和上限。
英文摘要:
In this work we consider \emph{temporal networks}, i.e. networks defined by a \emph{labeling} $λ$ assigning to each edge of an \emph{underlying graph} $G$ a set of \emph{discrete} time-labels. The labels of an edge, which are natural numbers, indicate the discrete time moments at which the edge is available. We focus on \emph{path problems} of temporal networks. In particular, we consider \emph{time-respecting} paths, i.e. paths whose edges are assigned by $λ$ a strictly increasing sequence of labels. We begin by giving two efficient algorithms for computing shortest time-respecting paths on a temporal network. We then prove that there is a \emph{natural analogue of Menger's theorem} holding for arbitrary temporal networks. Finally, we propose two \emph{cost minimization parameters} for temporal network design. One is the \emph{temporality} of $G$, in which the goal is to minimize the maximum number of labels of an edge, and the other is the \emph{temporal cost} of $G$, in which the goal is to minimize the total number of labels used. Optimization of these parameters is performed subject to some \emph{connectivity constraint}. We prove several lower and upper bounds for the temporality and the temporal cost of some very basic graph families such as rings, directed acyclic graphs, and trees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。