Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Lehman, April Rasala"'
Autor:
Lehman, April Rasala, 1977
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Includes bibliographical references (p. 115-118).
In the network coding problem, there are k commodities each with an associ
Includes bibliographical references (p. 115-118).
In the network coding problem, there are k commodities each with an associ
Externí odkaz:
http://hdl.handle.net/1721.1/30162
Given a graph G = (V,E) and k source-sink pairs of vertices, this papers investigates the maximum rate r at which all pairs can simultaneously communicate. We view this problem from two perspectives and compare their advantages. In the multicommodity
Externí odkaz:
http://hdl.handle.net/1721.1/30508
Publikováno v:
Proceedings of the 7th ACM Conference: Electronic Commerce; 6/11/2006, p150-159, 10p
Publikováno v:
Proceedings of the Seventeenth Annual ACM-SIAM Symposium: Discrete Algorithm; 1/22/2006, p241-250, 10p
Autor:
Lehman, April Rasala, Lehman, Eric
Publikováno v:
Proceedings of the Sixteenth Annual ACM-SIAM Symposium: Discrete Algorithms; 1/23/2005, p499-504, 6p
Autor:
Lehman, April Rasala, Lehman, Eric
Publikováno v:
Proceedings of the Fifteenth Annual ACM-SIAM Symposium: Discrete Algorithms; 1/11/2004, p142-150, 9p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.