Abstract
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 finds 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 n log n log n. Experimental results are presented showing that the actual running time of the algorithm is much smaller in practice.
Research supported by the National Science Foundation under grant CCR-9820902.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Agrawal, P. Klein, and R. Ravi, How tough is the minimum-degree Steiner tree? A new approximate min-max equality, TR CS-91-49, Brown University, 1991.
M. Fürer and B. Raghavachari, An NC approximation algorithm for the minimum degree spanning tree problem, In Proc. of the 28th Annual Allerton Conf. on Communication, Control and Computing, pages 274–281, 1990.
M. Fürer and B. Raghavachari, Approximating the minimum degree spanning tree to within one from the optimal degree, In Proc. of 3rd ACM-SIAM Symp. on Disc. Algorithms (SODA), pages 317–324, 1992.
M. Fürer and B. Raghavachari, Approximating the minimum-degree Steiner tree to within one of optimal, J. Algorithms, 17:409–423, 1994.
B. Gavish, Topological design of centralized computer networks — formulations and algorithms, Networks, 12:355–377, 1982.
D. E. Knuth, The Stanford GraphBase: a platform for combinatorial computing, Addison Wesley, 1993.
J. Könemann and R. Ravi, A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees, In Proc. of 32nd annual ACM Symposium on Theory of Computing (STOC), pages 537–546, 2000.
E. L. Lawler, Combinatorial optimization: networks and matroids, Holt, Rinehart and Winston, New York, 1976.
B. Raghavachari, Algorithms for finding low degree structures, In “Approximation algorithms,” D. Hochbaum (ed.), PWS Publishers Inc., pages 266–295, 1996.
R. Ravi, Rapid rumor ramification: approximating the minimum broadcast time, In Proc. of 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 202–213, 1994.
R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, Many birds with one stone: multi-objective approximation algorithms, In Proc. of 25th Annual ACM Symp. on the Theory of Computing (STOC), pages 438–447, 1993.
R. Ravi, B. Raghavachari, and P. Klein, Approximation through local optimality: designing networks with small degree, In Proc. of 12th Conf. on Foundations of Software Tech. and Theoret. Comp. Sci. (FSTTCS), pages 279–290. Lect. Notes in Comp. Sci. 652, 1992.
S. Win, On a connection between the existence of k-trees and the toughness of a graph, Graphs and Combinatorics, 5:201–205, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krishnan, R., Raghavachari, B. (2001). The Directed Minimum-Degree Spanning Tree Problem. In: Hariharan, R., Vinay, V., Mukund, M. (eds) FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2001. Lecture Notes in Computer Science, vol 2245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45294-X_20
Download citation
DOI: https://doi.org/10.1007/3-540-45294-X_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43002-5
Online ISBN: 978-3-540-45294-2
eBook Packages: Springer Book Archive