Approximating the traffic grooming problem
type: Item
instance of: scholarly article
title: Approximating the traffic grooming problem
zbMATH Open document ID: 1160.90342
author: Michele Flammini
author: Luca Moscardelli
author: Mordechai Shalom
author: Shmuel Zaks
published in: Journal of Discrete Algorithms
publication date: 2009-05-13T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5553600
zbMATH Keywords: wavelength assignment
zbMATH Keywords: wavelength division multiplexing (WDM)
zbMATH Keywords: optical networks
zbMATH Keywords: add-drop multiplexer (ADM)
zbMATH Keywords: traffic grooming
MaRDI profile type: Publication
full work available at URL: j.jda.2007.09.001
OpenAlex ID: W2007087349
cites work: Structural Information and Communication Complexity
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: The SONET edge‐partition problem
cites work: Q4946041
cites work: On the Complexity of the Traffic Grooming Problem in Optical Networks
DOI: 10.1016/J.JDA.2007.09.001
description: scientific article; zbMATH DE number 5553600