Temporal network optimization subject to connectivity constraints
type: Item
instance of: scholarly article
title: Temporal network optimization subject to connectivity constraints
zbMATH Open document ID: 1421.68139
author: George B. Mertzios
author: Othon Michail
author: P. G. Spirakis
published in: Algorithmica
publication date: 2019-04-25T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7047700
zbMATH Keywords: temporal network
zbMATH Keywords: graph labeling
zbMATH Keywords: Menger's theorem
zbMATH Keywords: optimization
zbMATH Keywords: temporal connectivity
zbMATH Keywords: hardness of approximation
MaRDI profile type: Publication
full work available at URL: s00453-018-0478-6
OpenAlex ID: W2835349798
cites work: Computation in networks of passively mobile finite-state sensors
cites work: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
cites work: Q5689807
cites work: Q4398864
cites work: Flooding time in edge-Markovian dynamic graphs
cites work: Introduction to algorithms
cites work: Complexity classifications of Boolean constraint satisfaction problems
cites work: On the Complexity of Information Spreading in Dynamic Networks
cites work: Efficient continuous-time dynamic network flow algorithms
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Distance labeling in graphs (extended abstract)
cites work: Labeling Schemes for Flow and Connectivity
cites work: Connectivity and inference problems for temporal networks
cites work: On Syntactic versus Computational Views of Approximability
cites work: Distributed computation in dynamic networks
cites work: Temporal Network Optimization Subject to Connectivity Constraints
cites work: An Introduction to Temporal Graphs: An Algorithmic Perspective*
cites work: Mediated population protocols
cites work: Causality, influence, and computation in possibly disconnected synchronous dynamic networks
cites work: Graph colouring and the probabilistic method
cites work: Q4736826
cites work: Dijkstra's algorithm on-line
cites work: COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
DOI: 10.1007/S00453-018-0478-6
Recommended article: Temporal Network Optimization Subject to Connectivity Constraints
Recommended article: The complexity of optimal design of temporally connected graphs
Recommended article: Q4895155
Recommended article: Time-varying network optimization.
Recommended article: Optimal Time-Varying Flows on Congested Networks
Recommended article: Robust resource allocations in temporal networks
Recommended article: Connectivity and inference problems for temporal networks
Recommended article: On solving quickest time problems in time-dependent, dynamic networks
Recommended article: Q3635591
description: scientific article; zbMATH DE number 7047700