Resilient capacity-aware routing
type: Item
instance of: scholarly article
title: Resilient capacity-aware routing
zbMATH Open document ID: 1467.68013
DOI: 10.1007/978-3-030-72016-2_22
author: Stefan Schmid
author: Nicolas Schnepf
author: Jiří Srba
publication date: 2021-08-04T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7378315
MaRDI profile type: Publication
full work available at URL: 978-3-030-72016-2 22
OpenAlex ID: W3137731263
cites work: NetKAT
cites work: A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Parallel Matrix and Graph Algorithms
cites work: Oracles for Distances Avoiding a Failed Node or Link
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Network-wide configuration synthesis
cites work: Increasing internet capacity using local search
cites work: Probabilistic NetKAT
cites work: Efficient Algorithms for Shortest Paths in Sparse Networks
cites work: Q3174943
cites work: Complexity of column generation in network design with path-based survivability mechanisms
cites work: Q4298260
cites work: A paradigm for listing \((s,t)\)-cuts in graphs
cites work: The complexity of minimum cut and maximum flow problems in an acyclic network
cites work: Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
cites work: Q3818127
cites work: Some complexity results for stateful network verification
description: scientific article; zbMATH DE number 7378315