1 |
Dahlhaus, E., Johnson, D. S., Papadimitriou, C. H., Seymour, P. D., Yannakakis, M. (1994), The complexity of multi-terminal cuts, SIAM J. Computing, 23, 864-894
DOI
ScienceOn
|
2 |
Myung, Y. -S. (2007), Algorithms for maximum integer multiflow and multicut in a ring network, Journal of Korean OR and MS society, 32, 89-97
|
3 |
Myung, Y. -S. (2008), A survey on network survivability models, Journal of the Korean Institute of Industrial Engineers, 34, 181-189
|
4 |
Vazirani, V. V. (2001) Approximation Algorithms, Springer, Berlin, 2001
|
5 |
Costa, M. -C., Letocart, L., Roupin, F. (2003), A greedy algorithm for multicut and integral multiflow in rooted trees, Operations Research Letters, 31, 21-27
DOI
ScienceOn
|
6 |
Suzuki, H., Ishiguro, A., and Nishizeki, T. (1992), Variable-priority queue and doghnut routing, Journal of Algorithms, 13, 606-635
DOI
|
7 |
Cosares, S., Deutch, N. D., Saniee, I., and Wasem, O. J. (1995), SONET toolkit : A decision support system for designing robust and cost-effective fiber-optic networks, Interfaces, 25, 20-40
DOI
ScienceOn
|
8 |
Garg, N., Vazirani, V. V., Yannakakis, M., Primal-dual approximation algorithms for integral flow and milticut in trees (1997), Algorithmica, 18, 3-20
DOI
ScienceOn
|
9 |
Wu, T. (1992), Fiber network survivability, Artech House, Inc.
|
10 |
Hong, S. -P. and Choi, B. -C. (2007), Approximability of the k-server disconnection problem, Networks, 50, 273-282
DOI
ScienceOn
|