Wavelength rerouting in optical networks, or the Venetian Routing problem
暂无分享,去创建一个
[1] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[2] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[3] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[4] Sven Oliver Krumke,et al. On the Minimum Label Spanning Tree Problem , 1998, Inf. Process. Lett..
[5] Oded Goldreich,et al. Efficient approximation of product distributions , 1998 .
[6] Jacques Stern,et al. The hardness of approximate optima in lattices, codes, and systems of linear equations , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[7] Jacques Stern,et al. The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations , 1997, J. Comput. Syst. Sci..
[8] Larry Stockmeyer,et al. Planar 3-colorability is polynomial complete , 1973, SIGA.
[9] Robert D. Carr,et al. On the red-blue set cover problem , 2000, SODA '00.
[10] Luca Trevisan,et al. Constraint satisfaction: the approximability of minimization problems , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.
[11] Gurusamy Mohan,et al. A time optimal wavelength rerouting algorithm for dynamic traffic in WDM networks , 1999 .
[12] Imrich Chlamtac,et al. Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..
[13] Mihir Bellare,et al. Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[14] C. Siva Ram Murthy,et al. Efficient algorithms for wavelength rerouting in WDM multi-fiber unidirectional ring networks , 1999, Comput. Commun..
[15] Luca Trevisan,et al. To Weight or Not to Weight: Where is the Question? , 1996, ISTCS.
[16] K. Lee,et al. A wavelength rerouting algorithm in wide-area all-optical networks , 1996 .
[17] Sanjeev Khanna,et al. Design networks with bounded pairwise distance , 1999, STOC '99.
[18] Uriel Feige,et al. Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..
[19] Johan Håstad,et al. Some optimal inapproximability results , 1997, STOC '97.
[20] Ian Holyer,et al. The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..