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 framework for solving Lower and Upper Bounded delay routing Tree (LUBT) problem using linear programming. LUBT is a Steiner tree rooted at the source such that the delays from the source to sinks lie between the given lower and upper bounds. It is shown that our proposed method produces minimum cost LUBT under a given topology for(More)
  • 1