( en | de | ru )

 

Disambiguation of "Awerbuch, Baruch"

Author of the publication

copydeleteadd this publication to your clipboard
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks.

, and . STOC, page 487-496. ACM, (1994)

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. You can also use the button next to the name to display some publications already assigned to the person.

Baruch Baruch

Jacob Awerbuch

Marianne Awerbuch

Bernhard Baruch

Otto Baruch

 

Other publications of authors with the same name

An Efficient Topology Update Protocol for Dynamic Networks., and . WDAG, volume 647 of Lecture Notes in Computer Science, page 185-202. Springer, (1992)On cost sharing mechanisms in the network design game., and . PODC, page 364-365. ACM, (2007)Adapting to a reliable network path., and . PODC, page 360-367. ACM, (2003)New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen., , , and . SIAM J. Comput., 28 (1): 254-262 (1998)On-Line Competitive Algorithms for Call Admission in Optical Networks., , , , and . Algorithmica, 31 (1): 29-43 (2001)Stateless Near Optimal Flow Control with Poly-logarithmic Convergence., and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 580-592. Springer, (2008)Local Management of a Global Resource in a Communication Network., , , and . J. ACM, 43 (1): 1-19 (1996)ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks., , , , and . ACM Trans. Inf. Syst. Secur., 10 (4): 6:1-6:35 (2008)Distributed algorithms for multicommodity flow problems via approximate steepest descent framework., , and . ACM Trans. Algorithms, 9 (1): 3:1-3:14 (2012)Polylogarithmic-Overhead Piecemeal Graph Exploration., and . COLT, page 280-286. ACM, (1998)