Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ALGORITHMICA
2004

favoriteEmaildiscussreport

153views more ALGORITHMICA 2004»

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

13 years 4 months ago

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

Download pluto.huji.ac.il

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

Real-time Traffic

Algorithm | ALGORITHMICA 2004 | Maximum Node Degree | Minimum Diameter |

claim paper

Related Content

» Degree Bounded Network Design with Metric Costs

» Primaldual meets local search approximating MSTs with nonuniform degree bounds

» Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem

» Greedy Heuristics and an Evolutionary Algorithm for the BoundedDiameter Minimum Spanning T...

» Computing a DiameterConstrained Minimum Spanning Tree in Parallel

» Approximating minimum bounded degree spanning trees to within one of optimal

» The MinimumArea Spanning Tree Problem

» Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by ClusteringBased Me...

» Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in ...

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2004
Where	ALGORITHMICA
Authors	Jochen Könemann, Asaf Levin, Amitabh Sinha

Comments (0)