( en | de | ru )

 

Disambiguation of "Zwick, Uri"

Author of the publication

copydeleteadd this publication to your clipboard
Constructing worst case instances for semidefinite programming based approximation algorithms.

, , and . SODA, page 92-100. ACM/SIAM, (2001)

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.

Uri Iurgel

Uri Oz

Uri Zilbersheid

Katrin Uri

Uri Schachtel

 

Other publications of authors with the same name

MAX CUT in cubic graphs., , and . SODA, page 506-513. ACM/SIAM, (2002)Maximum overhang., , , , and . SODA, page 756-765. SIAM, (2008)Connection caching under vaious models of communication., , and . SPAA, page 54-63. ACM, (2000)A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths.. ISAAC, volume 3341 of Lecture Notes in Computer Science, page 921-932. Springer, (2004)Union-Find with Constant Time Deletions., , , , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 78-89. Springer, (2005)A simpler implementation and analysis of Chazelle's soft heaps., and . SODA, page 477-485. SIAM, (2009)All-pairs bottleneck paths in vertex weighted graphs., , and . SODA, page 978-985. SIAM, (2007)On the Mysteries of MAX NAE-SAT., , , and . SODA, page 484-503. SIAM, (2021)On Dynamic Shortest Paths Problems., and . ESA, volume 3221 of Lecture Notes in Computer Science, page 580-591. Springer, (2004)Semidefinite Programming Based Approximation Algorithms.. FSTTCS, volume 2245 of Lecture Notes in Computer Science, page 57. Springer, (2001)