## On the Minimum Number of Wavelengths in Multicast Trees in WDM Networks

### Description

We consider the problem of minimizing the number of wavelengths needed to connect a given multicast set in a multihop WDM optical network. This problem was introduced and studied by Li et al. (Networks, 35(4), 260-265, 2000) who showed that it is NP-complete. They also presented an approximation algorithm for which they claimed an approximation ratio of c(1 +2 log Δ), where c is the maximum number of connected components in the subgraph induced by any wavelength and A is the maximum number of...[Show more]

Collections | ANU Research Publications |
---|---|

Date published: | 2005 |

Type: | Journal article |

URI: | http://hdl.handle.net/1885/85368 |

Source: | Networks |

DOI: | 10.1002/net.20048 |

### Download

File | Description | Size | Format | Image |
---|---|---|---|---|

01_Wan_On_the_Minimum_Number_of_2005.pdf | 127.34 kB | Adobe PDF | Request a copy |

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated: **20 July 2017**/
Responsible Officer: **University Librarian**/
Page Contact: **Library Systems & Web Coordinator**