Sciweavers

Share
ALGORITHMICA
2004

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

9 years 10 months ago
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.
Jochen Könemann, Asaf Levin, Amitabh Sinha
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2004
Where ALGORITHMICA
Authors Jochen Könemann, Asaf Levin, Amitabh Sinha
Comments (0)
books