In the Optimum Communication Spanning Tree (OCST) problem, a spanning tree for a complete graph has to be found that satisfies the communication requirements needed by the vertices with a minimum total cost. A special case of the OCST problem is the Optimum Distance Spanning Tree (ODST) problem, where the requirements are restricted to be constant. Both problems are known to be NP-hard. In this book, a randomized algorithm has been proposed to efficiently solve two special cases of the ODST problem. This can be achieved by randomly generating spanning trees with certain properties....
In the Optimum Communication Spanning Tree (OCST) problem, a spanning tree for a complete graph has to be found that satisfies the communica...