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 ...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.
