Simple Distributed Algorithms for Approximating Minimum Steiner Trees
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 380-389
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Ad Hoc Multicast Routing Algorithm with Swarm IntelligenceMobile Networks and Applications, 2005
- Minimum-Power Multicast Routing in Static Ad Hoc Wireless NetworksIEEE/ACM Transactions on Networking, 2004
- Energy-Efficient Broadcast and Multicast Trees in Wireless NetworksMobile Networks and Applications, 2002
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- Fast distributed construction of k-dominating sets and applications1995
- Core based trees (CBT)1993
- Randomized distributed shortest paths algorithms1989
- Complexity of network synchronizationJournal of the ACM, 1985
- Improvements in the time complexity of two message-optimal election algorithms1985
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983