( en | de | ru )

 

Disambiguation of "Kortsarz, Guy"

Author of the publication

copydeleteadd this publication to your clipboard
Hardness of Approximation for Vertex-Connectivity Network Design Problems.

, , and . SIAM J. Comput., 33 (3): 704-720 (2004)

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.

Olga Guyot

Thomas Guyet

Karl Guyot

Peter Guyot

Irene Guy

 

Other publications of authors with the same name

Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner., , and . ACM Trans. Algorithms, 12 (2): 25:1-25:16 (2016)The checkpoint problem., , , and . Theor. Comput. Sci., (2012)Approximating fault-tolerant group-Steiner problems., , and . Theor. Comput. Sci., (2012)Approximating some network design problems with node costs., and . Theor. Comput. Sci., 412 (35): 4482-4492 (2011)Tight lower bounds for the asymmetric k-center problem, , and . Electron. Colloquium Comput. Complex., (2003)Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design., , , and . SIAM J. Comput., 39 (5): 1772-1798 (2010)Advantage of Overlapping Clusters for Minimizing Conductance., , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 494-505. Springer, (2012)Two-Stage Robust Network Design with Exponential Scenarios., , , and . ESA, volume 5193 of Lecture Notes in Computer Science, page 589-600. Springer, (2008)Approximation Algorithm for Directed Multicuts., , and . WAOA, volume 3351 of Lecture Notes in Computer Science, page 61-67. Springer, (2004)Traffic-Light Scheduling on the Grid (Extended Abstract)., and . WDAG, volume 647 of Lecture Notes in Computer Science, page 238-252. Springer, (1992)