( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands.

, , , , , , и . IEEE/ACM Trans. Netw., 32 (2): 1435-1450 (апреля 2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Rogério Richa

Elie Richa

Richa Agarwal

Richa Nath

Richa Batra

 

Другие публикации лиц с тем же именем

Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design., и . SPAA, стр. 39-40. ACM, (2009)Optimal-stretch name-independent compact routing in doubling metrics., , и . PODC, стр. 198-207. ACM, (2006)Overlay Networks for Peer-to-Peer Networks., и . Handbook of Approximation Algorithms and Metaheuristics (2), Chapman and Hall/CRC, (2018)Minimum Maximum Degree Publish-Subscribe Overlay Network Design., и . INFOCOM, стр. 882-890. IEEE, (2009)Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks., , , , и . CoRR, (2020)Cluster Overlay Broadcast (COB): MANET Routing with Complexity Polynomial in Source-Destination Distance., , , и . IEEE Trans. Mob. Comput., 5 (6): 653-667 (2006)New Approximation Techniques for Some Linear Ordering Problems., и . SIAM J. Comput., 34 (2): 388-404 (2004)Minimum Maximum-Degree Publish-Subscribe Overlay Network Design., и . IEEE/ACM Trans. Netw., 19 (5): 1331-1343 (2011)Collaborative Computation in Self-Organizing Particle Systems., и . CoRR, (2017)A modular algorithm-theoretic framework for the fair and efficient collaborative prefetching of continuous media., , , , , и . IEEE Trans. Broadcast., 51 (2): 200-215 (2005)