Improving robustness of next-hop routing

DOI10.1007/s10878-014-9818-xzbMath1344.90061arXiv1411.2873OpenAlexW1996778788MaRDI QIDQ266050

Gordon Wilfong, W. Sean Kennedy, Glencora Borradaile, Lisa Zhang

Publication date: 13 April 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.2873

zbMATH Keywords

treegraphorientationacyclic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of IP and multiprotocol label switching fast reroute schemes
• Complexity of Finding Embeddings in a k-Tree
• Approximation algorithms for NP-complete problems on planar graphs
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: Improving robustness of next-hop routing