A better than “best possible” algorithm to edge color multigraphs
Journal of Algorithms
On the 1.1 edge-coloring of multigraphs
SIAM Journal on Discrete Mathematics
An optimal greedy heuristic to color interval graphs
Information Processing Letters
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the k-coloring of intervals
Discrete Applied Mathematics
A note on optical routing on trees
Information Processing Letters
Optimal wavelength routing on directed fiber trees
Theoretical Computer Science
On the wavelength assignment problem in multifiber WDM star and ring networks
IEEE/ACM Transactions on Networking (TON)
The complexity of path coloring and call scheduling
Theoretical Computer Science
Routing and path multicoloring
Information Processing Letters
Wavelength assignment and generalized interval graph coloring
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Maximizing the Number of Connections in Optical Tree Networks
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
A New Approximation Algorithm for the Demand Rouring and Slotting Problem with Unit Demands on Rings
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Satisfying a maximum number of pre-routed requests in all-optical rings
Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks
Efficient access to optical bandwidth
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Demand Routing and Slotting on Ring Networks
Demand Routing and Slotting on Ring Networks
Bandwidth allocation algorithms for all-optical networks
Bandwidth allocation algorithms for all-optical networks
| Hi-index | 0.00 |
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring problem (RPC). Here we present a polynomial time algorithm that solves RPC exactly in generalized tree networks of bounded degree. This new topology is of practical interest since it models tree-like backbone networks connecting bounded-size LANs of any form. Tree-like backbone structure is very common in practice and bounded size LANs is a reasonable assumption, since LANs are by nature networks unable to sustain a large number of hosts.