Temporal Network Optimization Subject to Connectivity Constraints
From MaRDI portal
Publication:5327473
DOI10.1007/978-3-642-39212-2_57zbMath1334.68027arXiv1502.04382OpenAlexW1945448203WikidataQ57607998 ScholiaQ57607998MaRDI QIDQ5327473
George B. Mertzios, Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
Publication date: 7 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.04382
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items
Traveling salesman problems in temporal graphs, Distance oracles for time-dependent networks, A Glimpse at Paul G. Spirakis, An Introduction to Temporal Graphs: An Algorithmic Perspective, On temporal graph exploration, Deleting edges to restrict the size of an epidemic in temporal networks, On Verifying and Maintaining Connectivity of Interval Temporal Networks, The complexity of optimal design of temporally connected graphs, Causality, influence, and computation in possibly disconnected synchronous dynamic networks, Temporal flows in temporal networks, Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks, Unnamed Item, Assigning times to minimise reachability in temporal graphs, Temporal Vertex Cover with a Sliding Time Window, Temporal network optimization subject to connectivity constraints, The Complexity of Finding Small Separators in Temporal Graphs, The complexity of routing with collision avoidance, The complexity of finding small separators in temporal graphs, Temporal graph classes: a view through temporal separators, The temporal explorer who returns to the base, On finding separators in temporal split and permutation graphs, How fast can we reach a target vertex in stochastic temporal graphs, Convergecast Tree on Temporal Graphs, An Introduction to Temporal Graphs: An Algorithmic Perspective*
