摘要
Selecting a cost optimum subset of discrete-value dispersion compensation modules (DV-DCMs) subject to maximum module count from an available set of DV-DCMs is a NP-hard problem. We derive a novel dynamic programming algorithm with pseudo-polynomial time bound and show that DV-DCM cost re-scaling can improve the running time.
Selecting a cost optimum subset of discrete-value dispersion compensation modules (DV-DCMs) subject to maximum module count from an available set of DV-DCMs is a NP-hard problem. We derive a novel dynamic programming algorithm with pseudo-polynomial time bound and show that DV-DCM cost re-scaling can improve the running time.
出处
《光学学报》
EI
CAS
CSCD
北大核心
2003年第S1期577-578,共2页
Acta Optica Sinica