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

FSTTCS

2001

Springer

2001

Springer

Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is the smallest among all such spanning trees. The problem is known to be NP-hard. A quasipolynomial time approximation algorithm for this problem is presented. The algorithm ﬁnds a spanning tree whose maximal degree is at most O(∆∗ + log n) where, ∆∗ is the degree of some optimal tree for the problem. The running time of the algorithm is shown to be O(nO(log n) ). Experimental results are presented showing that the actual running time of the algorithm is much smaller in practice.

Related Content

Added |
28 Jul 2010 |

Updated |
28 Jul 2010 |

Type |
Conference |

Year |
2001 |

Where |
FSTTCS |

Authors |
Radha Krishnan, Balaji Raghavachari |

Comments (0)