Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

We consider the problem of finding a minimum diameter spanning treewith maximum node degree $B$ in a complete undirected edge-weightedgraph. We provide an $O(sqrt{log_Bn})$-approximation algorithm for theproblem. Our algorithm is purely combinatorial, and relies on acombination of filtering and divide and conquer.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/41348/1/453_2004_Article_1121.pd

Improved Approximation Algorithms for the Freeze-Tag Problem

In the Freeze-Tag Problem, the objective is to awaken a set of \asleep" robots, starting with only one \awake" robot. A robot awakens a sleeping robot by moving to the sleeping robot's position. When a robot awakens, it is available to assist in awakening other slumbering robots. The objective is to compute an optimal awakening schedule such that all robots are awake by time t , for the smallest possible value of t . Because of its resemblance to the children's game of freeze-tag, this problem has been called Freeze-Tag Problem (FTP)