Follow
Zeev Nutov
Zeev Nutov
Verified email at openu.ac.il
Title
Cited by
Cited by
Year
Approximating minimum cost connectivity problems
G Kortsarz, Z Nutov
Dagstuhl Seminar Proceedings, 2010
1502010
Improved approximation algorithms for directed steiner forest
M Feldman, G Kortsarz, Z Nutov
Journal of Computer and System Sciences 78 (1), 279-292, 2012
952012
Approximating node connectivity problems via set covers
G Kortsarz, Z Nutov
Algorithmica 37, 75-92, 2003
932003
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
892007
Approximating minimum-cost connectivity problems via uncrossable bifamilies
Z Nutov
ACM Transactions on Algorithms (TALG) 9 (1), 1-16, 2012
882012
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
871999
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
632015
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
602013
Approximating k-node Connected Subgraphs via Critical Graphs
G Kortsarz, Z Nutov
SIAM Journal on Computing 35 (1), 247-257, 2005
602005
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
592006
Approximating Steiner networks with node-weights
Z Nutov
SIAM Journal on Computing 39 (7), 3001-3022, 2010
572010
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
552009
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
521999
An almost O(log k)-approximation for k-connected subgraphs
Z Nutov
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
512009
A 2-level cactus model for the system of minimum and minimum+ 1 edge-cuts in a graph and its incremental maintenance
Y Dinitz, Z Nutov
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
451995
On the tree augmentation problem
Z Nutov
Algorithmica 83, 553-575, 2021
422021
On rooted node-connectivity problems
J Cheriyan, T Jordán, Z Nutov
Algorithmica 30, 353-375, 2001
422001
Power optimization for connectivity problems
MT Hajiaghayi, G Kortsarz, VS Mirrokni, Z Nutov
Mathematical Programming 110 (1), 195-208, 2007
402007
Approximating node connectivity problems via set covers
G Kortsarz, Z Nutov
Approximation Algorithms for Combinatorial Optimization: Third International …, 2000
352000
Approximating connectivity augmentation problems
Z Nutov
Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005
342005
The system can't perform the operation now. Try again later.
Articles 1–20