scientific article; zbMATH DE number 910915
From MaRDI portal
Publication:4886092
zbMATH Open0960.68514MaRDI QIDQ4886092FDOQ4886092
Authors: Yonatan Aumann, Yuval Rabani 
Publication date: 21 October 1996
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
Cited In (23)
- Approximation algorithms for routing and call scheduling in all-optical chains and rings.
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm
- Efficient collective communciation in optical networks
- Coloring all directed paths in a symmetric tree, with an application to optical networks
- Short length Menger's theorem and reliable optical routing
- A note on optical routing on trees
- Colouring paths in directed symmetric trees with applications to WDM routing
- Approximations for the disjoint paths problem in high-diameter planar networks
- Approximating call-scheduling makespan in all-optical networks
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- New algorithms for maximum disjoint paths based on tree-likeness
- On-line routing in all-optical networks
- The permutation-path coloring problem on trees.
- Improved approximation for node-disjoint paths in grids with sources on the boundary
- On-line routing in all-optical networks
- Improved algorithms for scheduling unsplittable flows on paths
- Inapproximability and approximability of minimal tree routing and coloring
- Efficient delay routing
- Multicolor routing in the undirected hypercube
- New hardness results for routing on disjoint paths
- Sparse and limited wavelength conversion in all-optical tree networks
- All-to-all communication for some wavelength-routed all-optical networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886092)
