Resilient capacity-aware routing
From MaRDI portal
Publication:2044217
DOI10.1007/978-3-030-72016-2_22zbMath1467.68013OpenAlexW3137731263MaRDI QIDQ2044217
Nicolas Schnepf, Jiří Srba, Stefan Schmid
Publication date: 4 August 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-72016-2_22
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Network protocols (68M12)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Increasing internet capacity using local search
- A paradigm for listing \((s,t)\)-cuts in graphs
- Resilient capacity-aware routing
- Network-wide configuration synthesis
- Some complexity results for stateful network verification
- Probabilistic NetKAT
- Complexity of column generation in network design with path-based survivability mechanisms
- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
- Oracles for Distances Avoiding a Failed Node or Link
- A taxonomy of problems with fast parallel algorithms
- The complexity of minimum cut and maximum flow problems in an acyclic network
- Parallel Matrix and Graph Algorithms
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
- NetKAT
