Iksoo Pyo

Learn More
This paper presents an exact algorithm and two heuristics for solving the Bounded path length Minimal Spanning Tree (BMST) problem. The exact algorithm which is based on iterative negative-sum-exchange(s) has polynomial space complexity and is hence more practical than the method presented by Gabow. The first heuristic method (BKRUS) is based on the(More)
This paper presents a new approach for solving the Lower and Upper Bounded delay routing Tree (LUBT) problem using linear programming. LUBT is a Steiner tree r o oted at the source node such that delays from the source to sink nodes lie between the given lower and upper bounds. We show that our proposed method p r o duces minimum cost LUBT for a given(More)
  • 1