On the complexity of the regenerator cost problem in general networks with traffic grooming
type: Item
instance of: scholarly article
title: On the complexity of the regenerator cost problem in general networks with traffic grooming
zbMATH Open document ID: 1360.68507
author: Michele Flammini
author: Gianpiero Monaco
author: Mordechai Shalom
author: Shmuel Zaks
author: Luca Moscardelli
published in: Algorithmica
publication date: 2017-05-17T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6718309
zbMATH Keywords: optical networks
zbMATH Keywords: wavelength division multiplexing (WDM)
zbMATH Keywords: regenerators
zbMATH Keywords: traffic grooming
zbMATH Keywords: approximation algorithms
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: s00453-012-9693-8
OpenAlex ID: W1983847410
cites work: Hardness and approximation of traffic grooming
cites work: Q4258216
cites work: The regenerator location problem
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
cites work: Traffic partition in WDM/SONET rings to minimize SONET ADMs
cites work: Minimizing total busy time in parallel scheduling with application to optical networks
cites work: Optimizing regenerator cost in traffic grooming
cites work: Minimizing busy time in multiple machine real-time scheduling
cites work: Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
cites work: Q4258215
cites work: Q4471379
DOI: 10.1007/S00453-012-9693-8
Recommended article: On the Complexity of the Traffic Grooming Problem in Optical Networks
Recommended article: Hardness and Approximation of Traffic Grooming
Recommended article: Hardness and approximation of traffic grooming
Recommended article: Optimizing regenerator cost in traffic grooming
Recommended article: Approximating the traffic grooming problem in tree and star networks
Recommended article: Approximating the Traffic Grooming Problem in Tree and Star Networks
Recommended article: On the complexity and algorithm of grooming regular traffic in WDM optical networks
Recommended article: Algorithms and Computation
description: scientific article; zbMATH DE number 6718309