Author:
Min Manki,Pardalos Panos M.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference16 articles.
1. Ambühl C (2005) An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Proceedings of the 32nd international colloquium on automata, languages and programming (ICALP 2005), LNCS 3580. Springer, pp 1139–1150
2. Cagalj M, Hubaux J-P, Enz C (2002) Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In: Proceedings of the international conference on mobile computing and networking, pp 172–182
3. Cheng MX, Sun J, Min M, Du D-Z (2003) Energy-efficient broadcast and multicast routing in ad hoc wireless networks. In: Proceedings of the IEEE international conference on performance, computing, and communications conference, pp 87–94
4. Chvatal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4:233–235
5. Diot C, Dabbous W, Crowcroft J (1997) A survey of combinatorial optimization problems in multicast routing. IEEE J Selected Areas in Communications 15:277–290
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献