Browse > Article

Algorithms for Maximum Integer Multiflow and Multicut in a Ring Network  

Myung, Young-Soo (단국대학교 경상학부)
Publication Information
Journal of the Korean Operations Research and Management Science Society / v.32, no.2, 2007 , pp. 89-97 More about this Journal
Abstract
We study the maximum integer multiflow problem and the minimum multicut problem in a ring network. Both problems in a general network are known to be NP-hard. In this paper, we develop polynomial time algorithms to solve the problems. We also prove that even In a ring network, maximum multiflow is not always integral, which implies that the amount of maximum integer flow does not always reach the minimum capacity of multicut.
Keywords
maximum integer multiflow; minimum multicut; ring network;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Garey, M.R. and D.S. Johnson, Computers and intractability : a guide to the theory of NP - completeness, W.H. Freeman and Co., New York, 1979
2 Okamura, H. and P.D. Seymour, 'Multicommodity flows in planar graphs,' Journal of Combinatorial Theory Series E, Vol.31(1981), pp.75-81   DOI
3 Schrijver. A., Theory of Linear and Integer Programming, Wiley. 1986
4 Suzuki, H., A. Ishiguro and T. Nishizeki, 'Variable-Priority Queue and Doughnut Routing,' Journal of Algorithm, Vol.13(1992), pp.606-635   DOI
5 Wu, T.H., Fiber network service survivability, Artech House, Boston, MA, 1992
6 Frank, A., T. Nishizeki, N. Saito, H. Suzuki, and E. Tardos, 'Algorithms for routing around a rectangle,' Discrete Aplied Mathematics, Vol.40(1992), pp.363-78   DOI   ScienceOn
7 Schrijver, A., P. Seymour and P. Winkler, 'The ring loading problem,' SIAM J. Discrete Math, Vol.11(1998) pp.1-14   DOI   ScienceOn
8 Schrijver, A., Combinatorial optimization, Springer-Verlag, Berlin, 2003
9 Dell'Amico, M.L. and F. Maffioli, 'Exact Solution of the SONET Ring Loading Problem,' Operations Research Letters, Vol.26 (1999), pp,119-129
10 Myung, Y.-S., 'Multicommodity flows in cycle graphs,' Discrete Applied Math, Vol.154(2006), pp,1615-1621   DOI   ScienceOn
11 Myung, Y.-S. and H.-G. Kim, 'On the Ring Loading Problem with Demand Splitting,' Operations Research Letters, Vol.32(2004) pp,167-173   DOI   ScienceOn
12 Ahuja, R.K., T.L. Magnanti, and J,B. Orlin, Network Flows: theory, algorithms, and applications, Prentice-Hall, New Jersey, 1993
13 Bartholdi, J,J., J,B. Orlin, and H.D. Ratliff, 'Cyclic scheduling via integer programs with circular ones,' Operations Research, Vol.28(1980), pp.1074-1085   DOI   ScienceOn
14 Cosares, S., D.N. Deutsch, I. Saniee, and O.J. Wasem, 'SONET toolkit: a decision support system for designing robust and cost-effective fiber-optic networks,' Interfaces, Vol.25(1995), pp.20-40   DOI   ScienceOn
15 Myung, Y.-S., H.-G. Kim, and D.-W. Tcha, 'Optimal load balancing on SONET bidirectional rings,' Operations Research, Vol.45 (1997), pp,148-152   DOI   ScienceOn
16 Cosares, S. and I. Saniee, 'An optimization problem related to balancing loads on SONET rings,' Telecommunication Systems, Vol.3(1994), pp,165-181   DOI
17 Vachani, R., A. Shulman, and P. Kubat, 'Multicommodity flows in ring networks,' Informs Journal on Computing, Vol.8(1996), pp.235-242   DOI   ScienceOn
18 Wan, P.-J. and Y. Yang, 'Load-balanced routing in counter rotated SONET rings,' Networks, Vol.35(2000), pp.279-286   DOI   ScienceOn
19 Wang, B.-F., 'Linear Time Algorithms for the Ring Loading Problem with Demand Splitting,' Journal of Algorithm, Vol.54(2005) pp.45-57   DOI   ScienceOn
20 Myung, Y.-S., 'An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting,' SIAM J. Discrete Math, Vol.14(2001), pp.291-298   DOI   ScienceOn
21 명영수, '정수단위로만 루팅이 허용되는 SONET링의 용량결정문제', 한국경영과학회지, 제25권, 제1호(1998), pp.49-62
22 명영수, 김후곤, '분할이 허용된 링의 용량결정문제에 대한 개선된 해법', 한국경영과학지, 제26권, 제4호(2001) pp.99-108
23 Shyur, C.C., Y.M. Wu, and C.H. Chen, 'A capacity comparison for SONET self-healing ring networks,' IEEE GLOBECOM, Vol.3(1993), pp.1574-1578