( en | de | ru )

 

Disambiguation of "Kortsarz, Guy"

Author of the publication

copydeleteadd this publication to your clipboard
Improved approximation algorithms for Directed Steiner Forest.

, , and . J. Comput. Syst. Sci., 78 (1): 279-292 (2012)

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

On the Advantage of Overlapping Clusters for Minimizing Conductance., , and . Algorithmica, 69 (4): 844-863 (2014)Sum Multicoloring of Graphs., , , , and . J. Algorithms, 37 (2): 422-450 (2000)Approximating Shallow-Light Trees (Extended Abstract)., and . SODA, page 103-110. ACM/SIAM, (1997)Prize-collecting steiner network problems., , , and . ACM Trans. Algorithms, 9 (1): 2:1-2:13 (2012)An Improved Approximation of the Achromatic Number on Bipartite Graphs., and . SIAM J. Discret. Math., 21 (2): 361-373 (2007)From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More., , , , , , and . FOCS, page 743-754. IEEE Computer Society, (2017)Approximation Algorithms for Movement Repairmen., , , and . APPROX-RANDOM, volume 8096 of Lecture Notes in Computer Science, page 218-232. Springer, (2013)Approximating Some Network Design Problems with Node Costs., and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 231-243. Springer, (2009)Approximation algorithm for k-node connected subgraphs via critical graphs., and . STOC, page 138-145. ACM, (2004)Min Sum Edge Coloring in Multigraphs Via Configuration LP., , and . IPCO, volume 5035 of Lecture Notes in Computer Science, page 359-373. Springer, (2008)