1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
type: Item
instance of: scholarly article
title: 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
zbMATH Open document ID: 1191.68859
author: Zhengbing Bian
author: Qian-Ping Gu
published in: Information Processing Letters
publication date: 2010-06-16T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5722012
zbMATH Keywords: routing and path coloring
zbMATH Keywords: ring networks
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.12.010
OpenAlex ID: W2063944421
cites work: Q4737208
cites work: Algorithms and Data Structures
cites work: Wavelength Management in WDM Rings to Maximize the Number of Connections
cites work: On the \(k\)-coloring of intervals
cites work: Q3138921
cites work: The Complexity of Coloring Circular Arcs and Chords
cites work: Q4252739
cites work: Satisfying a maximum number of pre-routed requests in all-optical rings.
cites work: Efficient routing in all-optical networks
cites work: Coloring a Family of Circular Arcs
cites work: Q4250415
DOI: 10.1016/J.IPL.2008.12.010
Recommended article: Approximation algorithms for constructing wavelength routing networks
Recommended article: Solving routing and wavelength assignment problem with maximum edge-disjoint paths
Recommended article: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Recommended article: Q5469544
Recommended article: Routing with Maximum EDPs and Wavelength Assignment with Path Conflict Graphs
Recommended article: Q4501672
Recommended article: Efficient algorithms for wavelength assignment on trees of rings
Recommended article: Q4550354
Recommended article: An algorithm for node-capacitated ring routing
description: scientific article; zbMATH DE number 5722012