Sciweavers

3341 search results - page 50 / 669
» On Bounded Queries and Approximation
Sort
View
ALGORITHMICA
2004
153views more  ALGORITHMICA 2004»
14 years 9 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)-approximatio...
Jochen Könemann, Asaf Levin, Amitabh Sinha