Temporal Network Optimization Subject to Connectivity Constraints

In this work we consider temporal networks , i.e. networks defined by a labeling λ assigning to each edge of an underlying graph G 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 prob...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithmica Ročník 81; číslo 4; s. 1416 - 1449
Hlavní autoři: Mertzios, George B., Michail, Othon, Spirakis, Paul G.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.04.2019
Springer Nature B.V
Témata:
Algorithm Analysis and Problem Complexity
Algorithms
Computer Science
Computer Systems Organization and Communication Networks
Computing time
Data Structures and Information Theory
Graph theory
Labels
Mathematics of Computing
Network management systems
Networks
Number theory
Optimization
Parameters
Theory of Computation
Upper bounds
Menger’s theorem
Temporal connectivity
Graph labeling
Optimization
Temporal network
Hardness of approximation
ISSN:0178-4617, 1432-0541
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this work we consider temporal networks , i.e. networks defined by a labeling λ assigning to each edge of an underlying graph G 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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-018-0478-6