1 |
Boworntumrnarat, C et al., 'Using mesh and multi-ring methods in the design of survivable wavelength-routed all-optical networks,' European Transactions on Telecarmunications, Vol.2, No.16(2005), pp.157-172
|
2 |
CPLEX8.0, ILOG, 2003
|
3 |
Labbe, M et al., 'Covering a graph with cycles,' Computers and Operations Research, Vol.25, No.6(1998), pp.499-504
DOI
ScienceOn
|
4 |
Stem, T.E. and K Bala, Multiwavelength Optical Networks, Addison Wesley, 1999
|
5 |
Gardner, L.M et al., Techniques for finding Ring Covers in Survivable Networks, Proc' of IEEE Globecom, 1994
|
6 |
Wang, J. and W. Yurcik, A Multi-Ring Framework for Survivable Group Communications, Symposium of Command and Control Research Program, 2004
|
7 |
Thomassen, C, 'On the Complexity of Finding a Minimum Cycle Cover of a Graph,' SIAM. Journal on Computing, Vol.26, No.3 (1997), pp.675-677
|
8 |
Sholvin, J.K, Approximating the Longest Path Problem with Heuristics : A Survey,
B.S. Thesis, Northwestern Univ., 1999
|
9 |
Mehrotra, A et al., 'A Column Generation Approach for Graph Coloring,' Informs Journal on Computing, No.8(1996), pp.344-354
DOI
ScienceOn
|
10 |
이영호 외, 그물구조 WDM 망 설계 알고리즘과 망 설계 시스템 연구, '한국경영과학회지', 제30권, 제1호(2005), pp.1-15
과학기술학회마을
|
11 |
Wuttisittikulkij, L. et al., 'A Comparative study of mesh and multi--ring design for survivable WDMnetworks,' IEICE Trans. Commun, Vol.E83-B, No.10(2000), pp.2270-2277
|
12 |
Garey, MR. and D.S. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, 1979
|
13 |
Stidsen, T. and A.J. Glenstrup, 'Quantifying Optimal Mesh and Ring Design Costs,' Naval Research Logistics, No.25(2005), pp.150-158
DOI
ScienceOn
|