Abstract
Given a network G=(V,E), edge weights w(.), and a set of terminals SāāāV, the minimum-weight Steiner tree problem is to find a tree in G that spans S with minimum weight. Most provable heuristics treat the network G is a metric; This assumption, in a distributed setting, cannot be easily achieved without a subtle overhead.
We give a simple distributed algorithm based on a minimum spanning tree heuristic that returns a solution whose cost is within a factor of two of the optimal. The algorithm runs in time O(|V|log|V|) on a synchronous network. We also show that another heuristic based on iteratively finding shortest paths gives a Ī(log |V|)-approximation using a novel charging scheme based on low-congestion routing on trees. Both algorithms work for unit-cost and general cost cases. The algorithms also have applications in finding multicast trees in wireless ad hoc networks.
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
Takahashi, H., Matsuyama, A.: An approximate solution for the steiner problem in graphs. Math. Jap.Ā 24, 573ā577 (1980)
Shen, C.C., Jaikaeo, C.: Ad hoc multicast routing algorithm with swarm intelligence. Mob. Netw. Appl.Ā 10, 47ā59 (2005)
Wan, P.J., CĖalinescu, G., Yi, C.W.: Minimum-power multicast routing in static ad hoc wireless networks. IEEE/ACM Trans. Netw.Ā 12, 507ā514 (2004)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Francisco (1996)
Ballardie, T., Francis, P., Crowcroft, J.: Core based trees (CBT). In: Conference proceedings on Communications architectures, protocols and applications, pp. 85ā95. ACM Press, New York (1993)
Wei, L., Estrin, D.: Multicast routing in dense and sparse modes: simulation study of tradeoffs and dynamics. In: Proceedings of the 4th International Conference on Computer Communications and Networks (ICCCN 1995), p. 150. IEEE Computer Society, Los Alamitos (1995)
Pendarakis, D., Shi, S., Verma, D., Waldvogel, M.: ALMI: An application level multicast infrastructure. In: 3rd USNIX Symposium on Internet Technologies and Systems (USITS 2001), San Francisco, CA, USA, pp. 49ā60 (2001)
Robins, G., Zelikovsky, A.: Improved steiner tree approximation in graphs. In: Proceedings of the eleventh annual ACM-SIAMsymposium on Discrete algorithms, Society for Industrial and Applied Mathematics, pp. 770ā779 (2000)
Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACMĀ 45, 753ā782 (1998)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Energy-efficient broadcast and multicast trees in wireless networks. Mob. Netw. Appl.Ā 7, 481ā492 (2002)
Wan, P.J., CĖalinescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcasting in static ad hoc wireless networks. Wirel. Netw.Ā 8, 607ā617 (2002)
Tarjan, R.E.: Data structures and network algorithms. Society for Industrial and Applied Mathematics, Philadelphia (1983)
Awerbuch, B.: Complexity of network synchronization. J. ACMĀ 32, 804ā823 (1985)
Awerbuch, B.: Randomized distributed shortest paths algorithms. In: Proceedings of the twenty-first annual ACM symposium on Theory of computing, pp. 490ā500. ACM Press, New York (1989)
Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimumweight spanning trees. ACM Trans. Program. Lang. Syst.Ā 5, 66ā77 (1983)
Elkin, M.: A faster distributed protocol for constructing a minimum spanning tree. In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 359ā368. SIAM, Philadelphia (2004)
Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 230ā240. ACM Press, New York (1987)
Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. In: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, pp. 238ā251. ACM Press, New York (1995)
Gafni, E.: Improvements in the time complexity of two message-optimal election algorithms. In: Proceedings of the fourth annual ACM symposium on Principles of distributed computing, pp. 175ā185. ACM Press, New York (1985)
Boruvka, O.: O jistĆ©m problĆ©mu minimĆ”ln?Ģm. PrĆ”ca MorauskĆ© PrĢirodovÄdeckĆ© SpolecĢnosiĀ 3, 37ā58 (1926)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chalermsook, P., Fakcharoenphol, J. (2005). Simple Distributed Algorithms for Approximating Minimum Steiner Trees. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_39
Download citation
DOI: https://doi.org/10.1007/11533719_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)