 | 2009 |
|---|
| 57 |       | Guy Kortsarz,
Zeev Nutov:
Approximating Some Network Design Problems with Node Costs.
APPROX-RANDOM 2009: 231-243 |
| 56 | | Zeev Nutov:
Approximating Node-Connectivity Augmentation Problems.
APPROX-RANDOM 2009: 286-297 |
| 55 | | Zeev Nutov:
An almost O(log k)-approximation for k-connected subgraphs.
SODA 2009: 912-921 |
| 54 | | Moran Feldman,
Guy Kortsarz,
Zeev Nutov:
Improved approximating algorithms for Directed Steiner Forest.
SODA 2009: 922-931 |
| 53 | | Guy Even,
Jon Feldman,
Guy Kortsarz,
Zeev Nutov:
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
ACM Transactions on Algorithms 5(2): (2009) |
| 52 | | Zeev Nutov:
Listing minimal edge-covers of intersecting families with applications to connectivity problems.
Discrete Applied Mathematics 157(1): 112-117 (2009) |
| 51 | | Guy Kortsarz,
Zeev Nutov:
Approximating minimum-power edge-covers and 2, 3-connectivity.
Discrete Applied Mathematics 157(8): 1840-1847 (2009) |
| 50 | | Zeev Nutov:
A note on Rooted Survivable Networks.
Inf. Process. Lett. 109(19): 1114-1119 (2009) |
| 49 | | Zeev Nutov,
Ariel Yaroshevitch:
Wireless network design via 3-decompositions.
Inf. Process. Lett. 109(19): 1136-1140 (2009) |
| 48 | | Yuval Lando,
Zeev Nutov:
Inapproximability of survivable networks.
Theor. Comput. Sci. 410(21-23): 2122-2125 (2009) |
| 2008 |
|---|
| 47 | | Michael Elkin,
Yuval Lando,
Zeev Nutov,
Michael Segal,
Hanan Shpungin:
Novel Algorithms for the Network Lifetime Problem in Wireless Settings.
ADHOC-NOW 2008: 425-438 |
| 46 | | Zeev Nutov:
Approximating Minimum-Power k-Connectivity.
ADHOC-NOW 2008: 86-93 |
| 45 | | Guy Kortsarz,
Michael Langberg,
Zeev Nutov:
Approximating Maximum Subgraphs without Short Cycles.
APPROX-RANDOM 2008: 118-131 |
| 44 | | Yuval Lando,
Zeev Nutov:
Inapproximability of Survivable Networks.
APPROX-RANDOM 2008: 146-152 |
| 43 | | Zeev Nutov:
Approximating Directed Weighted-Degree Constrained Networks.
APPROX-RANDOM 2008: 219-232 |
| 42 | | Zeev Nutov:
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows.
DIALM-POMC 2008: 29-34 |
| 41 | | Zeev Nutov:
Approximating Steiner Networks with Node Weights.
LATIN 2008: 411-422 |
| 40 | | Guy Kortsarz,
Vahab S. Mirrokni,
Zeev Nutov,
Elena Tsanko:
Approximating Minimum-Power Degree and Connectivity Problems.
LATIN 2008: 423-435 |
| 39 | | Zeev Nutov:
On extremal k-outconnected graphs.
Discrete Mathematics 308(12): 2533-2543 (2008) |
| 38 | | Zeev Nutov,
Daniel Reichman:
Approximating maximum satisfiable subsystems of linear equations of bounded width.
Inf. Process. Lett. 106(5): 203-207 (2008) |
| 37 | | Guy Kortsarz,
Zeev Nutov:
Tight approximation algorithm for connectivity augmentation problems.
J. Comput. Syst. Sci. 74(5): 662-670 (2008) |
| 36 | | Guy Kortsarz,
Zeev Nutov:
A note on two source location problems.
J. Discrete Algorithms 6(3): 520-525 (2008) |
| 2007 |
|---|
| 35 | | Israel Beniaminy,
Zeev Nutov,
Meir Ovadia:
Approximating Interval Scheduling Problems with Bounded Profits.
ESA 2007: 487-497 |
| 34 | | Yuval Lando,
Zeev Nutov:
On Minimum Power Connectivity Problems.
ESA 2007: 87-98 |
| 33 | | Michael Krivelevich,
Zeev Nutov,
Mohammad R. Salavatipour,
Jacques Yuster,
Raphael Yuster:
Approximation algorithms and hardness results for cycle packing problems.
ACM Transactions on Algorithms 3(4): (2007) |
| 32 |  | Zeev Nutov,
Masao Tsugaki:
On (t, k)-shredders in k-connected graphs.
Ars Comb. 83: (2007) |
| 31 | | Zeev Nutov,
Raphael Yuster:
Packing directed cycles efficiently.
Discrete Applied Mathematics 155(2): 82-91 (2007) |
| 30 | | Sharon Feldman,
Guy Kortsarz,
Zeev Nutov:
Improved approximation algorithms for directed Steiner forest.
Electronic Colloquium on Computational Complexity (ECCC) 14(120): (2007) |
| 29 | | Gilad Liberman,
Zeev Nutov:
On shredders and vertex connectivity augmentation.
J. Discrete Algorithms 5(1): 91-101 (2007) |
| 28 | | Mohammad Taghi Hajiaghayi,
Guy Kortsarz,
Vahab S. Mirrokni,
Zeev Nutov:
Power optimization for connectivity problems.
Math. Program. 110(1): 195-208 (2007) |
| 2006 |
|---|
| 27 | | Zeev Nutov:
Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems.
APPROX-RANDOM 2006: 236-247 |
| 26 | | Guy Kortsarz,
Zeev Nutov:
Tight Approximation Algorithm for Connectivity Augmentation Problems.
ICALP (1) 2006: 443-452 |
| 25 | | Zeev Nutov:
Approximating Rooted Connectivity Augmentation Problems.
Algorithmica 44(3): 213-231 (2006) |
| 24 | | Zeev Nutov,
Israel Beniaminy,
Raphael Yuster:
A (1-1/e)-approximation algorithm for the generalized assignment problem.
Oper. Res. Lett. 34(3): 283-288 (2006) |
| 2005 |
|---|
| 23 | | Mohammad Taghi Hajiaghayi,
Guy Kortsarz,
Vahab S. Mirrokni,
Zeev Nutov:
Power Optimization for Connectivity Problems.
IPCO 2005: 349-361 |
| 22 | | Zeev Nutov:
Approximating connectivity augmentation problems.
SODA 2005: 176-185 |
| 21 | | Michael Krivelevich,
Zeev Nutov,
Raphael Yuster:
Approximation algorithms for cycle packing problems.
SODA 2005: 556-561 |
| 20 | | Yana Kortsarts,
Guy Kortsarz,
Zeev Nutov:
Greedy approximation algorithms for directed multicuts.
Networks 45(4): 214-217 (2005) |
| 19 | | Guy Kortsarz,
Zeev Nutov:
Approximating k-node Connected Subgraphs via Critical Graphs.
SIAM J. Comput. 35(1): 247-257 (2005) |
| 2004 |
|---|
| 18 | | Zeev Nutov,
Raphael Yuster:
Packing Directed Cycles Efficiently.
MFCS 2004: 310-321 |
| 17 | | Guy Kortsarz,
Zeev Nutov:
Approximation algorithm for k-node connected subgraphs via critical graphs.
STOC 2004: 138-145 |
| 16 | | Yana Kortsarts,
Guy Kortsarz,
Zeev Nutov:
Approximation Algorithm for Directed Multicuts.
WAOA 2004: 61-67 |
| 2003 |
|---|
| 15 | | Zeev Nutov:
Approximating Rooted Connectivity Augmentation Problems.
RANDOM-APPROX 2003: 141-152 |
| 14 | | Guy Kortsarz,
Zeev Nutov:
Approximating Node Connectivity Problems via Set Covers.
Algorithmica 37(2): 75-92 (2003) |
| 2001 |
|---|
| 13 | | Guy Even,
Jon Feldman,
Guy Kortsarz,
Zeev Nutov:
A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set.
RANDOM-APPROX 2001: 90-101 |
| 12 | | Joseph Cheriyan,
Tibor Jordán,
Zeev Nutov:
On Rooted Node-Connectivity Problems.
Algorithmica 30(3): 353-375 (2001) |
| 2000 |
|---|
| 11 | | Guy Kortsarz,
Zeev Nutov:
Approximating node connectivity problems via set covers.
APPROX 2000: 194-205 |
| 10 | | Zeev Nutov,
Michal Penn:
On Integrality, Stability and Composition of Dicycle Packings and Covers.
J. Comb. Optim. 4(2): 235-251 (2000) |
| 9 | | Zeev Nutov:
Approximating multiroot 3-outconnected subgraphs.
Networks 36(3): 172-179 (2000) |
| 1999 |
|---|
| 8 | | Zeev Nutov:
Approximating Multiroot 3-Outconnected Subgraphs.
SODA 1999: 951-952 |
| 7 | | Vincenzo Auletta,
Yefim Dinitz,
Zeev Nutov,
Domenico Parente:
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph.
J. Algorithms 32(1): 21-30 (1999) |
| 6 | | Yefim Dinitz,
Zeev Nutov:
A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs.
J. Algorithms 32(1): 31-40 (1999) |
| 1998 |
|---|
| 5 | | Joseph Cheriyan,
Tibor Jordán,
Zeev Nutov:
Approximating k-outconnected Subgraph Problems.
APPROX 1998: 77-88 |
| 1997 |
|---|
| 4 | | Yefim Dinitz,
Zeev Nutov:
Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5.
CIAC 1997: 13-24 |
| 3 | | Zeev Nutov,
Michal Penn:
Faster approximation algorithms for weighted triconnectivity augmentation problems.
Oper. Res. Lett. 21(5): 219-223 (1997) |
| 1995 |
|---|
| 2 | | Yefim Dinitz,
Zeev Nutov:
A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance.
STOC 1995: 509-518 |
| 1 | | Zeev Nutov,
Michal Penn:
on the Integral Dicycle Packings and Covers and the Linear ordering Polytope.
Discrete Applied Mathematics 60(1-3): 293-309 (1995) |
