Maximizing profits of routing in WDM networks
type: Item
instance of: scholarly article
title: Maximizing profits of routing in WDM networks
zbMATH Open document ID: 1093.90071
author: Jianping Li
author: Kang Li
author: Lusheng Wang
author: Hao Zhao
published in: Journal of Combinatorial Optimization
publication date: 2006-02-08T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5005136
zbMATH Keywords: minimum-cost flow
zbMATH Keywords: routing
zbMATH Keywords: path coloring
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s10878-005-2263-0
OpenAlex ID: W1985134401
cites work: Q4737208
cites work: On the \(k\)-coloring of intervals
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Q4198056
cites work: Satisfying a maximum number of pre-routed requests in all-optical rings.
cites work: Efficient routing in all-optical networks
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: The Ring Loading Problem
cites work: Q3707420
cites work: Q4250415
cites work: Q4250199
DOI: 10.1007/S10878-005-2263-0
description: scientific article; zbMATH DE number 5005136