dkk
Member level 2
Hi all
I would like to know how to prove that a "routing and wavelength assgnment" or "traffic grooming problem" in WDM networkis NP coplete/NP hard problem.
thanks
DKK
I would like to know how to prove that a "routing and wavelength assgnment" or "traffic grooming problem" in WDM networkis NP coplete/NP hard problem.
thanks
DKK