@article{ART002120248},
author={Sang-Un, Lee},
title={Augmenting Path Algorithm for Routing Telephone Calls Problem},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2016},
volume={21},
number={6},
pages={77-81}
TY - JOUR
AU - Sang-Un, Lee
TI - Augmenting Path Algorithm for Routing Telephone Calls Problem
JO - Journal of The Korea Society of Computer and Information
PY - 2016
VL - 21
IS - 6
PB - The Korean Society Of Computer And Information
SP - 77
EP - 81
SN - 1598-849X
AB - This paper deals with the optimization problem that decides the routing of connection between multi-source and multi-sink. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with time complexity to solve the optimal solution for this problem. This paper suggests the simple method that assigns the possible call flow quantity to augmenting path of city pair satisfied with demand of . The proposed algorithm can be get the same optimal solution as LP for experimental data.
KW - Routing;Multiple-source;Multiple-sink;Multi-commodity flow;Flow network;Augmenting path
DO -
UR -
ER -
Sang-Un, Lee. (2016). Augmenting Path Algorithm for Routing Telephone Calls Problem. Journal of The Korea Society of Computer and Information, 21(6), 77-81.
Sang-Un, Lee. 2016, "Augmenting Path Algorithm for Routing Telephone Calls Problem", Journal of The Korea Society of Computer and Information, vol.21, no.6 pp.77-81.
Sang-Un, Lee "Augmenting Path Algorithm for Routing Telephone Calls Problem" Journal of The Korea Society of Computer and Information 21.6 pp.77-81 (2016) : 77.
Sang-Un, Lee. Augmenting Path Algorithm for Routing Telephone Calls Problem. 2016; 21(6), 77-81.
Sang-Un, Lee. "Augmenting Path Algorithm for Routing Telephone Calls Problem" Journal of The Korea Society of Computer and Information 21, no.6 (2016) : 77-81.
Sang-Un, Lee. Augmenting Path Algorithm for Routing Telephone Calls Problem. Journal of The Korea Society of Computer and Information, 21(6), 77-81.
Sang-Un, Lee. Augmenting Path Algorithm for Routing Telephone Calls Problem. Journal of The Korea Society of Computer and Information. 2016; 21(6) 77-81.
Sang-Un, Lee. Augmenting Path Algorithm for Routing Telephone Calls Problem. 2016; 21(6), 77-81.
Sang-Un, Lee. "Augmenting Path Algorithm for Routing Telephone Calls Problem" Journal of The Korea Society of Computer and Information 21, no.6 (2016) : 77-81.
