Approximating minimum cost connectivity problems G Kortsarz, Z Nutov Dagstuhl Seminar Proceedings, 2010 | 147 | 2010 |

Approximating node connectivity problems via set covers G Kortsarz, Z Nutov Algorithmica 37 (2), 75-92, 2003 | 91 | 2003 |

Approximating minimum-cost connectivity problems via uncrossable bifamilies Z Nutov ACM Transactions on Algorithms (TALG) 9 (1), 1-16, 2012 | 83 | 2012 |

Improved approximation algorithms for directed steiner forest M Feldman, G Kortsarz, Z Nutov Journal of Computer and System Sciences 78 (1), 279-292, 2012 | 81 | 2012 |

A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph V Auletta, Y Dinitz, Z Nutov, D Parente Journal of Algorithms 32 (1), 21-30, 1999 | 80 | 1999 |

Approximation algorithms and hardness results for cycle packing problems M Krivelevich, Z Nutov, MR Salavatipour, J Verstraete, R Yuster ACM Transactions on Algorithms (TALG) 3 (4), 48-es, 2007 | 60 | 2007 |

Approximating *k*-node Connected Subgraphs via Critical GraphsG Kortsarz, Z Nutov SIAM Journal on Computing 35 (1), 247-257, 2005 | 56 | 2005 |

A (1–1/e)-approximation algorithm for the generalized assignment problem Z Nutov, I Beniaminy, R Yuster Operations Research Letters 34 (3), 283-288, 2006 | 53 | 2006 |

A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2 G Kortsarz, Z Nutov ACM Transactions on Algorithms (TALG) 12 (2), 1-20, 2015 | 50 | 2015 |

An almost *O*(log *k*)-approximation for *k*-connected subgraphsZ Nutov Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009 | 50 | 2009 |

A 3-approximation algorithm for finding optimum 4, 5-vertex-connected spanning subgraphs Y Dinitz, Z Nutov Journal of Algorithms 32 (1), 31-40, 1999 | 50 | 1999 |

Approximating Steiner networks with node-weights Z Nutov SIAM Journal on Computing 39 (7), 3001-3022, 2010 | 48 | 2010 |

A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2 G Even, J Feldman, G Kortsarz, Z Nutov ACM Transactions on Algorithms (TALG) 5 (2), 1-17, 2009 | 41 | 2009 |

On rooted node-connectivity problems J Cheriyan, T Jordán, Z Nutov Algorithmica 30 (3), 353-375, 2001 | 41 | 2001 |

A (1+ ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius N Cohen, Z Nutov Theoretical Computer Science 489, 67-74, 2013 | 40 | 2013 |

Approximating node connectivity problems via set covers G Kortsarz, Z Nutov International Workshop on Approximation Algorithms for Combinatorial …, 2000 | 36 | 2000 |

Power optimization for connectivity problems MT Hajiaghayi, G Kortsarz, VS Mirrokni, Z Nutov Mathematical Programming 110 (1), 195-208, 2007 | 34 | 2007 |

Approximating connectivity augmentation problems Z Nutov SODA 5, 176-185, 2005 | 34 | 2005 |

Power optimization for connectivity problems MT Hajiaghayi, G Kortsarz, VS Mirrokni, Z Nutov International Conference on Integer Programming and Combinatorial …, 2005 | 33 | 2005 |

Iterative rounding approximation algorithms for degree-bounded node-connectivity network design T Fukunaga, Z Nutov, R Ravi SIAM Journal on Computing 44 (5), 1202-1229, 2015 | 31 | 2015 |