Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms
type: Item
instance of: scholarly article
title: Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms
zbMATH Open document ID: 1188.90063
author: Zhe Liang
author: Meeyoung Cha
author: Sue B. Moon
author: Wanpracha A. Chaovalitwongse
published in: Computers \& Operations Research
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5720307
zbMATH Keywords: mixed integer program
zbMATH Keywords: telecommunication
zbMATH Keywords: multicast
zbMATH Keywords: shared risk link groups
zbMATH Keywords: multi-objective
MaRDI profile type: Publication
full work available at URL: j.cor.2009.12.009
OpenAlex ID: W1976411149
cites work: A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
cites work: Survivable IP network design with OSPF routing
cites work: Efficient multicasting over large-scale WLANs through controlled association
cites work: Q4198056
cites work: Optimal multicast route packing
cites work: On the complexity of the Maximum Subgraph Problem
cites work: A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
cites work: A survey of combinatorial optimization problems in multicast routing
cites work: Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks
cites work: A combinatorial algorithm for message scheduling on controller area networks
cites work: Q5294069
cites work: A heuristic for the Steiner problem in graphs
cites work: Constructing disjoint paths on expander graphs
cites work: A preference-based approach to spanning trees and shortest paths problems
cites work: On a multicriteria shortest path problem
cites work: Q5395365
cites work: Q3972953
cites work: Q3360021
cites work: Node-and edge-deletion NP-complete problems
cites work: Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraints
DOI: 10.1016/J.COR.2009.12.009
description: scientific article; zbMATH DE number 5720307