Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximation algorithm for the problem. Our algorithm is purely combinatorial, and relies on a combination of filtering and divide and conquer.

• Type: Journal
• Year: 2004
• Where: ALGORITHMICA
• Authors: Jochen Könemann, Asaf Levin, Amitabh Sinha
• Keywords: Algorithm, ALGORITHMICA 2004, Maximum Node Degree, Minimum Diameter