본문 바로가기
  • Home

Augmenting Path Algorithm for Routing Telephone Calls Problem

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2016, 21(6), pp.77-81
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

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.

Citation status

* References for papers published after 2022 are currently being built.