
This site is powered by Aigaion  A PHP/Web based management system for shared and annotated bibliographies.
For more information visit Aigaion.nl.  
Type of publication:  Inproceedings 
Entered by:  
Title  Temporal Network Optimization Subject to Connectivity Constraints 
Bibtex cite ID  RACTIRU120132 
Booktitle  40th International Colloquium on Automata, Languages and Programming  ICALP 2013 
Series  Lecture Notes in Computer Science 
Year published  2013 
Volume  7966 
Pages  657668 
Publisher  Springer Berlin Heidelberg 
Location  Riga, Latvia 
URL  http://www.icalp2013.lu.lv/ 
DOI  10.1007/9783642392122_57 
Keywords  temporal network,graph labeling,Menger's theorem,optimization,temporal connectivity,hardness of approximation,tradeoff 
Abstract  In this work we consider temporal networks, i.e. networks defined by a labeling $\lambda$ assigning to each edge of an underlying graph G a set of discrete timelabels. 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 timerespecting paths, i.e. paths whose edges are assigned by $\lambda$ a strictly increasing sequence of labels. We begin by giving two efficient algorithms for computing shortest timerespecting 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. 
Authors  
Topics
 
BibTeX  BibTeX 
RIS  RIS 
Attachments 
MMCSicalp13.pdf (main file) 

Publication ID  977 

