Simple distributed algorithms for approximating minimum steiner trees

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 380-389

  Chalermsook, Parinya ^a,b   Fakcharoenphol, Jittat ^b  

^a ASIAN INSTITUTE OF TECHNOLOGY   (Thailand)

^b KASETSART UNIVERSITY   (Thailand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; EDGE DETECTION; HEURISTIC METHODS; ITERATIVE METHODS; MULTICASTING; TELECOMMUNICATION NETWORKS; AD HOC NETWORKS; COMBINATORIAL MATHEMATICS; COSTS; WIRELESS AD HOC NETWORKS;

DISTRIBUTED ALGORITHMS; MULTICAST TREES; SPANNING TREE HEURISTICS; STEINER TREE PROBLEMS; CHARGING SCHEME; MINIMUM SPANNING TREES; MINIMUM WEIGHT; MULTICAST TREE; SHORTEST PATH; STEINER TREE PROBLEM; STEINER TREES; SYNCHRONOUS NETWORKS;

TREES (MATHEMATICS);

EID: 26844482356     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_39     Document Type: Conference Paper

References (20)

1. Takahashi, H., Matsuyama, A.: An approximate solution for the steiner problem in graphs. Math. Jap. 24 (1980) 573-577
2. Shen, C.C., Jaikaeo, C.: Ad hoc multicast routing algorithm with swarm intelligence. Mob. Netw. Appl. 10 (2005) 47-59
3. Wan, P.J., Cǎlinescu, G., Yi, C.W.: Minimum-power multicast routing in static ad hoc wireless networks. IEEE/ACM Trans. Netw. 12 (2004) 507-514
4. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers, Inc (1996)
5. Ballardie, T., Francis, P., Crowcroft, J.: Core based trees (CBT). In: Conference proceedings on Communications architectures, protocols and applications, ACM Press (1993) 85-95
6. 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 '95), IEEE Computer Society (1995) 150
7. Pendarakis, D., Shi, S., Verma, D., Waldvogel, M.: ALMI: An application level multicast infrastructure. In: 3rd USNIX Symposium on Internet Technologies and Systems (USITS '01), San Francisco, CA, USA (2001) 49-60
8. Robins, G., Zelikovsky, A.: Improved steiner tree approximation in graphs. In: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics (2000) 770-779
9. Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM 45 (1998) 753-782
10. Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Energy-efficient broadcast and multicast trees in wireless networks. Mob. Netw. Appl. 7 (2002) 481-492
11. Wan, P.J., Cǎlinescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcasting in static ad hoc wireless networks. Wirel. Netw. 8 (2002) 607-617
12. Tarjan, R.E.: Data structures and network algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1983)
13. Awerbuch, B.: Complexity of network synchronization. J. ACM 32 (1985) 804-823
14. Awerbuch, B.: Randomized distributed shortest paths algorithms. In: Proceedings of the twenty-first annual ACM symposium on Theory of computing, ACM Press (1989) 490-500
15. Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5 (1983) 66-77
16. Elkin, M.: A faster distributed protocol for constructing a minimum spanning tree. In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics (2004) 359-368
17. 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, ACM Press (1987) 230-240
18. 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, ACM Press (1995) 238-251
19. 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, ACM Press (1985) 175-185
20. Boruvka, O.: O jistém problému minimálním. Práca Morauské Přirodovědecké Společnosi 3 (1926) 37-58