Approximation algorithm for optimal location of concentrators and design of capacitated survivable backbone networks

DOI10.1504/IJMOR.2011.037311zbMATH Open1204.90016OpenAlexW2027010846MaRDI QIDQ622809FDOQ622809

Authors: Arun Jotshi, Sarat Puthenpura, Wenjie Zhao 

Publication date: 4 February 2011

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

Full work available at URL: https://doi.org/10.1504/ijmor.2011.037311

Recommendations

• scientific article; zbMATH DE number 1253063
• Efficient algorithms for the capacitated concentrator location problem
• Concentrator location in telecommunications networks.
• Designing least-cost survivable wireless backhaul networks
• Survivability in hierarchical telecommunications networks

zbMATH Keywords

facility locationnetwork designaccess networkslink failure\(k\)-connected networkscapacitated backbone networksconcentrator locationsnetwork costssurvivable backbone networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Cited In (1)

• An Algorithm for the Design of Multitype Concentrator Networks

This page was built for publication: Approximation algorithm for optimal location of concentrators and design of capacitated survivable backbone networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622809)