NP Complete/ NP hard problem

Status
Not open for further replies.
D

dkk

Member level 2
Joined
Jun 6, 2006
Messages
47
Helped
4
Reputation
8
Reaction score
0
Trophy points
1,286
Activity points
1,587
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
 

Status
Not open for further replies.

Similar threads

Menu
Log in
Register
Cookies are required to use this site. You must accept them to continue using the site. Learn more…