The complexity of path coloring and call scheduling

Theoretical Computer Science

Volumn 255, Issue 1-2, 2001, Pages 33-50

  Erlebach, Thomas ^a,c   Jansen, Klaus ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

^c ETH ZURICH   (Switzerland)

Author keywords

Call scheduling; Optical networks; Path coloring; Rings; Trees

Indexed keywords

APPROXIMATION THEORY; BANDWIDTH; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); ELECTRIC NETWORK TOPOLOGY; OPTICAL COMMUNICATION; TELECOMMUNICATION TRAFFIC; WAVELENGTH DIVISION MULTIPLEXING;

ALL-OPTICAL NETWORKS; PATH COLORING;

FIBER OPTIC NETWORKS;

EID: 0034900138     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00152-8     Document Type: Article

References (44)

1. Efficient routing in optical networks
2. On-line routing in all-optical networks
3. Graph problems arising from wavelength-routing in all-optical networks
4. Scheduling multiprocessor tasks to minimize schedule length
5. Special issue on Dense Wavelength Division Multiplexing Techniques for High Capacity and Multiple Access Communication Systems
6. Scheduling file transfers
7. Algorithmic aspects of one-dimensional layout compaction
8. Call scheduling in trees, rings and meshes
9. Off-line and on-line call-scheduling in stars and trees
10. Scheduling of virtual connections in fast networks
11. An optimal greedy algorithm for wavelength allocation in directed tree networks
12. The complexity of coloring circular arcs and chords
13. Colouring paths in directed symmetric trees with applications to WDM routing
14. The edge intersection graphs of paths in a tree
15. Efficient algorithms for interval graphs and circular-arc graphs
16. The NP-completeness of edge-coloring
17. Complexity of scheduling multiprocessor tasks with prespecified processor allocations
18. Approximation results for wavelength routing in directed trees
19. Efficient wavelength routing on directed fiber trees
20. Constrained bipartite edge coloring with applications to wavelength routing
21. The complexity of wire routing and finding the minimum area layouts for arbitrary VLSI circuits
22. A note on optical routing on trees
23. Approximating circular arc coloring and bandwidth allocation in all-optical ring networks
24. Improved access to optical bandwidth in trees
25. Randomized lower bounds for online path coloring
26. On the complexity of the disjoint paths problem
27. Efficient access to optical bandwidth
28. On the 1.1 edge-coloring of multigraphs
29. 2) algorithm for coloring proper circular arc graphs
30. Path coloring on the mesh
31. Efficient routing in all-optical networks
32. An approximation algorithm for coloring circular-arc graphs
33. Decomposition by clique separators
34. Coloring a family of circular arcs
35. ATM concepts, architectures, and protocols
36. Ring routing and wavelength translation
37. The edge-disjoint paths problem is NP-complete for partial k-trees