Temporal Network Optimization Subject to Connectivity Constraints



Mertzios, George, Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul ORCID: 0000-0001-5396-3749
(2019) Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica: an international journal in computer science, 81. 1416 - 1449.

[img] Text
MMS18-Algorithmica.pdf - Accepted Version

Download (518kB)

Abstract

In this work we consider temporal networks, i.e. networks defined by a labelingλ assigning to each edge of an underlying graphG a set of 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 path problems of temporal networks. In particular, we consider 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 natural analogue of Menger’s theorem holding for arbitrary temporal networks. Finally, we propose two cost minimization parameters for temporal network design. One is the temporality of G, in which the goal is to minimize the maximum number of labels of an edge, and the other is the 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 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.

Item Type: Article
Uncontrolled Keywords: temporal network, graph labelling, Menger's theorem, optimization, temporal connectivity, hardness of approximation
Depositing User: Symplectic Admin
Date Deposited: 28 Jun 2018 08:53
Last Modified: 10 Aug 2022 13:00
DOI: 10.1007/s00453-018-0478-6
Open Access URL: https://link.springer.com/article/10.1007/s00453-0...
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3023127