Circular and radial design comparison of survivability in asymmetrical hierarchical networks

DOI10.1080/00207160.2011.582535zbMath1237.68021OpenAlexW2166492672MaRDI QIDQ2885521

Vahid Hashemi, Hassan Salehi Fathabadi

Publication date: 23 May 2012

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2011.582535

zbMATH Keywords

network designsurvivabilitymulticommodity flow network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Cites Work

• Approximation algorithms for a hierarchically structured bin packing problem
• SONET/SDH ring assignment with capacity constraints
• Deterministic network interdiction
• A cutting plane algorithm for computing \(k\)-edge survivability of a network
• Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements
• Approximation algorithms for hierarchical location problems
• Unnamed Item
• Unnamed Item