Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

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

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top