scientific article; zbMATH DE number 910915
From MaRDI portal
Publication:4886092
zbMath0960.68514MaRDI QIDQ4886092
Publication date: 21 October 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
Related Items
A note on optical routing on trees, Coloring all directed paths in a symmetric tree, with an application to optical networks, Colouring paths in directed symmetric trees with applications to WDM routing, Approximating call-scheduling makespan in all-optical networks, Efficient delay routing, The permutation-path coloring problem on trees., Improved algorithms for scheduling unsplittable flows on paths, Unnamed Item, On-line routing in all-optical networks, Multicolor routing in the undirected hypercube, Inapproximability and approximability of minimal tree routing and coloring, Finding edge-disjoint paths in networks: an ant colony optimization algorithm, Short length Menger's theorem and reliable optical routing, New algorithms for maximum disjoint paths based on tree-likeness, Sparse and limited wavelength conversion in all-optical tree networks, All-to-all communication for some wavelength-routed all-optical networks, Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, New Hardness Results for Routing on Disjoint Paths, Approximations for the disjoint paths problem in high-diameter planar networks, An Approximation Algorithm for Fully Planar Edge-Disjoint Paths, Efficient collective communciation in optical networks, On-line routing in all-optical networks, Approximation algorithms for routing and call scheduling in all-optical chains and rings.
