( en | de | ru )

 

Disambiguation of "Kortsarz, Guy"

Author of the publication

copydeleteadd this publication to your clipboard
Two-stage Robust Network Design with Exponential Scenarios.

, , , and . Algorithmica, 65 (2): 391-408 (2013)

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

Approximation algorithm for k-node connected subgraphs via critical graphs., and . STOC, page 138-145. ACM, (2004)Approximating Shallow-Light Trees (Extended Abstract)., and . SODA, page 103-110. ACM/SIAM, (1997)Asymmetric k-center is log* n-hard to approximate., , , , , , and . J. ACM, 52 (4): 538-551 (2005)Prize-collecting steiner network problems., , , and . ACM Trans. Algorithms, 9 (1): 2:1-2:13 (2012)The Foundations of Fixed Parameter Inapproximability., , and . CoRR, (2013)On Set Expansion Problems and the Small Set Expansion Conjecture., and . WG, volume 8747 of Lecture Notes in Computer Science, page 189-200. Springer, (2014)Approximation Algorithms for Minimum Time Broadcast., and . ISTCS, volume 601 of Lecture Notes in Computer Science, page 67-78. Springer, (1992)Min Sum Edge Coloring in Multigraphs Via Configuration LP., , and . IPCO, volume 5035 of Lecture Notes in Computer Science, page 359-373. Springer, (2008)Tight Approximation Algorithm for Connectivity Augmentation Problems., and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 443-452. Springer, (2006)Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria., , , and . WAOA, volume 3351 of Lecture Notes in Computer Science, page 68-82. Springer, (2004)