On-line routing in all-optical networks
type: Item
instance of: scholarly article
title: On-line routing in all-optical networks
zbMATH Open document ID: 0933.68005
DOI: 10.1016/S0304-3975(99)00025-0
published in: Theoretical Computer Science
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 68M07
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1387419
zbMATH Keywords: online algorithms
zbMATH Keywords: competitive analysis
zbMATH Keywords: routing
zbMATH Keywords: optical networks
author: Yair Bartal
author: Stefano Leonardi
MaRDI profile type: Publication
cites work: Q3128902
cites work: On-line load balancing with applications to machine scheduling and virtual circuit routing
cites work: Q4886092
cites work: On-line competitive algorithms for call admission in optical networks
cites work: Q3128890
cites work: Q4228508
cites work: Efficient wavelength routing on directed fiber trees
cites work: Constrained bipartite edge coloring with applications to wavelength routing
cites work: The Linearity of First-Fit Coloring of Interval Graphs
cites work: Q3950561
cites work: Q4231910
cites work: Q5501821
cites work: Q3998976
cites work: Q4252739
cites work: Efficient routing in all-optical networks
cites work: Optimal on-line coloring of circular arc graphs
full work available at URL: s0304-3975(99)00025-0
OpenAlex ID: W148398262
description: scientific article; zbMATH DE number 1387419