On the power (saving) of network coding

43rd Annual Allerton Conference on Communication, Control and Computing 2005

Volumn 2, Issue , 2005, Pages 766-773

  Jain, Kamal ^a   Talwar, Kunal ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84962054018     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. R. Ahlswede, N. Cai, S. Y. R. Li, and R. W. Yeung. Network information flow. IEEE Transactions on Information Theory, IT-46:1204-1216, 2000.
2. Sudipto Guha and Samir Khuller. Approximation algorithms for connected dominating sets. In ESA, 1996.
3. Naveen Garg, Goran Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. J. Algorithms, 37(1):66-84, 2000.
4. Sudipto Guha, Anna Moss, Joseph (Seffi) Naor, and Baruch Schieber. Efficient recovery from power outage (extended abstract). In STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of computing, pages 574-582, New York, NY, USA, 1999. ACM Press.
5. Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, and Nan Wang. Inte-grality ratio for group steiner trees and directed steiner trees. In SODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pages 275-284, Philadelphia, PA, USA, 2003. Society for Industrial and Applied Mathematics.
6. Philip Klein and R. Ravi. A nearly best-possible approximation algorithm for node-weighted steiner trees. J. Algorithms, 19(1):104-115, 1995. http://www.networkcoding.info.
7. Y. Wu, P. A. Chou, and S. Y. Kung. Minimum-energy multicast in mobile ad hoc networks using network coding. In 2004 IEEE Information Theory Workshop, 2004.
8. Jorg Widmer, Christina Fragouli, and Jean-Yves Le Boudec. Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding. In First Workshop on Network Coding, Theory, and Applications (NetCod 2005), Riva del Garda, Italy, April 2005.