The following pages link to (Q4886092):
Displaying 23 items.
- A note on optical routing on trees (Q287098) (← links)
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- Approximating call-scheduling makespan in all-optical networks (Q876731) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- Efficient delay routing (Q1128715) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- The permutation-path coloring problem on trees. (Q1401295) (← links)
- Efficient collective communciation in optical networks (Q1575944) (← links)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- Approximation algorithms for routing and call scheduling in all-optical chains and rings. (Q1853488) (← links)
- On-line routing in all-optical networks (Q1960517) (← links)
- Multicolor routing in the undirected hypercube (Q1971219) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- Improved algorithms for scheduling unsplittable flows on paths (Q2684488) (← links)
- New Hardness Results for Routing on Disjoint Paths (Q3387753) (← links)
- All-to-all communication for some wavelength-routed all-optical networks (Q4254353) (← links)
- Coloring all directed paths in a symmetric tree, with an application to optical networks (Q4539866) (← links)
- Colouring paths in directed symmetric trees with applications to WDM routing (Q4571981) (← links)
- On-line routing in all-optical networks (Q4571982) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- Improved approximation for node-disjoint paths in grids with sources on the boundary (Q5002709) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535) (← links)
- Sparse and limited wavelength conversion in all-optical tree networks (Q5958780) (← links)
