- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j51 |      | Rohit Khandekar, Guy Kortsarz, Zeev Nutov: On some network design problems with degree constraints. J. Comput. Syst. Sci. 79(5): 725-736 (2013) |
| j50 | | Shimon Avadis, Anat Lerner, Zeev Nutov: MMM: multi-channel TDMA with MPR capabilities for MANETs. Wireless Networks 19(3): 323-330 (2013) |
| i9 | | Nachshon Cohen, Zeev Nutov: Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points. CoRR abs/1304.7571 (2013) |
| 2012 | ||
| j49 | | Zeev Nutov: Approximating Node-Connectivity Augmentation Problems. Algorithmica 63(1-2): 398-410 (2012) |
| j48 | | Rani Izsak, Zeev Nutov: A note on labeling schemes for graph connectivity. Inf. Process. Lett. 112(1-2): 39-43 (2012) |
| j47 | | Moran Feldman, Guy Kortsarz, Zeev Nutov: Improved approximation algorithms for Directed Steiner Forest. J. Comput. Syst. Sci. 78(1): 279-292 (2012) |
| j46 | | |
| j45 | | Lior Kamma, Zeev Nutov: Approximating survivable networks with minimum number of steiner points. Networks 60(4): 245-252 (2012) |
| j44 | | Zeev Nutov: Approximating minimum-cost connectivity problems via uncrossable bifamilies. ACM Transactions on Algorithms 9(1): 1 (2012) |
| j43 | | Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Prize-collecting steiner network problems. ACM Transactions on Algorithms 9(1): 2 (2012) |
| j42 | | Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Approximating fault-tolerant group-Steiner problems. Theor. Comput. Sci. 416: 55-64 (2012) |
| j41 | | Zeev Nutov, Michael Segal: Improved approximation algorithms for maximum lifetime problems in wireless networks. Theor. Comput. Sci. 453: 88-97 (2012) |
| c42 | | |
| c41 | | |
| c40 | | |
| c39 | | |
| c38 | | Dariusz R. Kowalski, Zeev Nutov, Michael Segal: Scheduling of Vehicles in Transportation Networks. Nets4Cars/Nets4Trains 2012: 124-136 |
| i8 | | |
| i7 | | Zeev Nutov: Approximating minimum-cost edge-covers of crossing biset-families. CoRR abs/1207.4366 (2012) |
| i6 | | Zeev Nutov: A unified approach to source location via rooted network augmentation. CoRR abs/1210.4728 (2012) |
| 2011 | ||
| j40 | | Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko: Approximating Minimum-Power Degree and Connectivity Problems. Algorithmica 60(4): 735-742 (2011) |
| j39 | | Guy Even, Guy Kortsarz, Zeev Nutov: A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. Inf. Process. Lett. 111(6): 296-300 (2011) |
| j38 | | Johnny David, Zeev Nutov: Approximating survivable networks with β-metric costs. J. Discrete Algorithms 9(2): 170-175 (2011) |
| j37 | | Zeev Nutov: Approximating directed weighted-degree constrained networks. Theor. Comput. Sci. 412(8-10): 901-912 (2011) |
| j36 | | Guy Kortsarz, Zeev Nutov: Approximating some network design problems with node costs. Theor. Comput. Sci. 412(35): 4482-4492 (2011) |
| j35 | | Michael Elkin, Yuval Lando, Zeev Nutov, Michael Segal, Hanan Shpungin: Novel algorithms for the network lifetime problem in wireless settings. Wireless Networks 17(2): 397-410 (2011) |
| c37 | | Nachshon Cohen, Zeev Nutov: A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius. APPROX-RANDOM 2011: 147-157 |
| c36 | | Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Network-Design with Degree Constraints. APPROX-RANDOM 2011: 289-301 |
| c35 | | |
| i5 | | |
| i4 | | |
| i3 | | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Combinatorial Algorithms for Capacitated Network Design. CoRR abs/1108.1176 (2011) |
| i2 | | Marek Cygan, Guy Kortsarz, Zeev Nutov: Steiner Forest Orientation Problems. CoRR abs/1112.2273 (2011) |
| 2010 | ||
| j34 | | Zeev Nutov: Approximating Minimum-Power k-Connectivity. Ad Hoc & Sensor Wireless Networks 9(1-2): 129-137 (2010) |
| j33 | | Yael Maduel, Zeev Nutov: Covering a laminar family by leaf to leaf links. Discrete Applied Mathematics 158(13): 1424-1432 (2010) |
| j32 | | Yuval Lando, Zeev Nutov: On minimum power connectivity problems. J. Discrete Algorithms 8(2): 164-173 (2010) |
| j31 | | Zeev Nutov: Approximating Steiner Networks with Node-Weights. SIAM J. Comput. 39(7): 3001-3022 (2010) |
| j30 | | Guy Kortsarz, Michael Langberg, Zeev Nutov: Approximating Maximum Subgraphs without Short Cycles. SIAM J. Discrete Math. 24(1): 255-269 (2010) |
| j29 | | Zeev Nutov: Approximating minimum power covers of intersecting families and directed edge-connectivity problems. Theor. Comput. Sci. 411(26-28): 2502-2512 (2010) |
| c34 | | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Prize-Collecting Steiner Network Problems. IPCO 2010: 71-84 |
| c33 | | Lior Kamma, Zeev Nutov: Approximating Survivable Networks with Minimum Number of Steiner Points. WAOA 2010: 154-165 |
| 2009 | ||
| j28 | | Zeev Nutov: Listing minimal edge-covers of intersecting families with applications to connectivity problems. Discrete Applied Mathematics 157(1): 112-117 (2009) |
| j27 | | Guy Kortsarz, Zeev Nutov: Approximating minimum-power edge-covers and 2, 3-connectivity. Discrete Applied Mathematics 157(8): 1840-1847 (2009) |
| j26 | | |
| j25 | | Zeev Nutov, Ariel Yaroshevitch: Wireless network design via 3-decompositions. Inf. Process. Lett. 109(19): 1136-1140 (2009) |
| j24 | | 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) |
| j23 | | Zeev Nutov: Approximating connectivity augmentation problems. ACM Transactions on Algorithms 6(1) (2009) |
| j22 | | Yuval Lando, Zeev Nutov: Inapproximability of survivable networks. Theor. Comput. Sci. 410(21-23): 2122-2125 (2009) |
| c32 | | Zeev Nutov, Michael Segal: Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks. ALGOSENSORS 2009: 41-51 |
| c31 | | Guy Kortsarz, Zeev Nutov: Approximating Some Network Design Problems with Node Costs. APPROX-RANDOM 2009: 231-243 |
| c30 | | |
| c29 | | Zeev Nutov: Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions. FOCS 2009: 417-426 |
| c28 | | Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Approximating Fault-Tolerant Group-Steiner Problems. FSTTCS 2009: 263-274 |
| c27 | | |
| c26 | | Moran Feldman, Guy Kortsarz, Zeev Nutov: Improved approximating algorithms for Directed Steiner Forest. SODA 2009: 922-931 |
| 2008 | ||
| j21 | | |
| j20 | | Zeev Nutov, Daniel Reichman: Approximating maximum satisfiable subsystems of linear equations of bounded width. Inf. Process. Lett. 106(5): 203-207 (2008) |
| j19 | | Guy Kortsarz, Zeev Nutov: Tight approximation algorithm for connectivity augmentation problems. J. Comput. Syst. Sci. 74(5): 662-670 (2008) |
| j18 | | Guy Kortsarz, Zeev Nutov: A note on two source location problems. J. Discrete Algorithms 6(3): 520-525 (2008) |
| c25 | | |
| c24 | | 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 |
| c23 | | Guy Kortsarz, Michael Langberg, Zeev Nutov: Approximating Maximum Subgraphs without Short Cycles. APPROX-RANDOM 2008: 118-131 |
| c22 | | |
| c21 | | Zeev Nutov: Approximating Directed Weighted-Degree Constrained Networks. APPROX-RANDOM 2008: 219-232 |
| c20 | | Zeev Nutov: Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows. DIALM-POMC 2008: 29-34 |
| c19 | | |
| c18 | | Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko: Approximating Minimum-Power Degree and Connectivity Problems. LATIN 2008: 423-435 |
| 2007 | ||
| j17 |  | |
| j16 | | Zeev Nutov, Raphael Yuster: Packing directed cycles efficiently. Discrete Applied Mathematics 155(2): 82-91 (2007) |
| j15 | | Gilad Liberman, Zeev Nutov: On shredders and vertex connectivity augmentation. J. Discrete Algorithms 5(1): 91-101 (2007) |
| j14 | | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov: Power optimization for connectivity problems. Math. Program. 110(1): 195-208 (2007) |
| j13 | | 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) |
| c17 | | |
| c16 | | Israel Beniaminy, Zeev Nutov, Meir Ovadia: Approximating Interval Scheduling Problems with Bounded Profits. ESA 2007: 487-497 |
| i1 | | Sharon Feldman, Guy Kortsarz, Zeev Nutov: Improved approximation algorithms for directed Steiner forest. Electronic Colloquium on Computational Complexity (ECCC) 14(120) (2007) |
| 2006 | ||
| j12 | | Zeev Nutov: Approximating Rooted Connectivity Augmentation Problems. Algorithmica 44(3): 213-231 (2006) |
| j11 | | 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) |
| c15 | | Zeev Nutov: Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems. APPROX-RANDOM 2006: 236-247 |
| c14 | | Guy Kortsarz, Zeev Nutov: Tight Approximation Algorithm for Connectivity Augmentation Problems. ICALP (1) 2006: 443-452 |
| 2005 | ||
| j10 | | Yana Kortsarts, Guy Kortsarz, Zeev Nutov: Greedy approximation algorithms for directed multicuts. Networks 45(4): 214-217 (2005) |
| j9 | | Guy Kortsarz, Zeev Nutov: Approximating k-node Connected Subgraphs via Critical Graphs. SIAM J. Comput. 35(1): 247-257 (2005) |
| c13 | | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov: Power Optimization for Connectivity Problems. IPCO 2005: 349-361 |
| c12 | | |
| c11 | | Michael Krivelevich, Zeev Nutov, Raphael Yuster: Approximation algorithms for cycle packing problems. SODA 2005: 556-561 |
| 2004 | ||
| c10 | | |
| c9 | | Guy Kortsarz, Zeev Nutov: Approximation algorithm for k-node connected subgraphs via critical graphs. STOC 2004: 138-145 |
| c8 | | Yana Kortsarts, Guy Kortsarz, Zeev Nutov: Approximation Algorithm for Directed Multicuts. WAOA 2004: 61-67 |
| 2003 | ||
| j8 | | Guy Kortsarz, Zeev Nutov: Approximating Node Connectivity Problems via Set Covers. Algorithmica 37(2): 75-92 (2003) |
| c7 | | |
| 2001 | ||
| j7 | | Joseph Cheriyan, Tibor Jordán, Zeev Nutov: On Rooted Node-Connectivity Problems. Algorithmica 30(3): 353-375 (2001) |
| c6 | | 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 |
| 2000 | ||
| j6 | | Zeev Nutov, Michal Penn: On Integrality, Stability and Composition of Dicycle Packings and Covers. J. Comb. Optim. 4(2): 235-251 (2000) |
| j5 | | |
| c5 | | Guy Kortsarz, Zeev Nutov: Approximating node connectivity problems via set covers. APPROX 2000: 194-205 |
| 1999 | ||
| j4 | | 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) |
| j3 | | Yefim Dinitz, Zeev Nutov: A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs. J. Algorithms 32(1): 31-40 (1999) |
| c4 | | |
| 1998 | ||
| c3 | | Joseph Cheriyan, Tibor Jordán, Zeev Nutov: Approximating k-outconnected Subgraph Problems. APPROX 1998: 77-88 |
| 1997 | ||
| j2 | | Zeev Nutov, Michal Penn: Faster approximation algorithms for weighted triconnectivity augmentation problems. Oper. Res. Lett. 21(5): 219-223 (1997) |
| c2 | | Yefim Dinitz, Zeev Nutov: Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5. CIAC 1997: 13-24 |
| 1995 | ||
| j1 | | 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) |
| c1 | | 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 |
Colors in the list of coauthors
Last update Fri May 24 18:38:44 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page