Data structures and network algorithms
Data structures and network algorithms
Complexity of network synchronization
Journal of the ACM (JACM)
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Randomized distributed shortest paths algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Fast distributed construction of k-dominating sets and applications
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Improvements in the time complexity of two message-optimal election algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
Multicast routing in dense and sparse modes: simulation study of tradeoffs and dynamics
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
A faster distributed protocol for constructing a minimum spanning tree
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum-power multicast routing in static ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Ad hoc multicast routing algorithm with swarm intelligence
Mobile Networks and Applications
ALMI: an application level multicast infrastructure
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Short proofs for online multiclass prediction on graphs
Information Processing Letters
Theory of communication networks
Algorithms and theory of computation handbook
Fast routing table construction using small messages: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Duty-cycle-aware minimum-energy multicasting in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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.