Network flows for functions

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 234-238

  Shah, Virag ^a   Dey, Bikash Kumar ^b   Manjunath, D ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY COMMUNICATION; ARBITRARY FUNCTIONS; CAPACITY CONSTRAINTS; DIRECTED TREES; DISTRIBUTED DATA; DISTRIBUTED FUNCTION; LINEAR PROGRAMS; NETWORK FLOW TECHNIQUES; NETWORK FLOWS; TERMINAL NODES;

DECISION TREES; INFORMATION THEORY; SENSOR NETWORKS; SENSOR NODES; SENSORS; TELECOMMUNICATION EQUIPMENT;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 80054824868     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033983     Document Type: Conference Paper

References (12)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall Inc, 1993.
2. F. Shahrokhi and D. Matula, "The maximum concurrent flow problem", J. ACM, vol. 37, pp. 318334, 1990.
3. R. G. Gallager, "Finding parity in simple broadcast networks", IEEE Tram, on Inform. Th., vol. 34, pp. 176-180, 1988.
4. A. Giridhar and P. R. Kumar, "Computing and communicating functions over sensor networks", IEEE Jour. on Sel. Areas in Commun., vol. 23, no. 4, pp. 755-764, April 2005.
5. S. Kamath and D. Manjunath, "On distributed function computation in structure-free random networks", in Proc. of IEEE ISIT, Toronto, Canada, July 2008.
6. T. S. Han and K. Kobayashi, "A dichotomy of functions f (x, y) of correlated sources (x, y)", IEEE Trans. Inform. Th., vol. 33, pp. 69-86, 1987.
7. A. Orlitsky and J. R. Roche, "Coding for computing", IEEE Trans. Inform. Th., vol. 47, no. 3, pp. 903-917, 2001.
8. B. K. Rai and B. K. Dey, "Sum-networks: system of polynomial equations, reversibility, insufficiency of linear network coding, unachievability of coding capacity", Submitted to IEEE Trans. Inform. Th., available at http://arxiv.org/abs/0906.0695.
9. R. Appuswamy, M. Franceschetti, N. Karamchandani, and K. Zeger, "Network coding for computing part i: Cut-set bounds", Submitted to IEEE Trans. Inform. Th., available at http://arxiv.org/abs/0912.2820.
10. G. Karakostas, "Faster approximation schemes for fractional multicommodity flow problems", ACM Trans. Algorithms, vol. 4, pp. 1-17, 2008.
11. Z. Li and B. Li, "Network coding in undirected networks", in Proc. of 38th CISS, Princeton, NJ, Mar. 2004, pp. 257-262.
12. V. Shah, B. K. Dey and D. Manjunath, "Network Flows for Functions", available at http://arxiv.org/abs/1009.6057.