| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Rani Izsak, Zeev Nutov |
A note on labeling schemes for graph connectivity.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
Approximating fault-tolerant group-Steiner problems. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Node-Connectivity Augmentation Problems. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Small $\ell$-edge-covers in $k$-connected graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Moran Feldman, Guy Kortsarz, Zeev Nutov |
Improved approximation algorithms for Directed Steiner Forest. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Survivable Network Activation Problems. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Degree-Constrained Node-Connectivity. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dariusz R. Kowalski, Zeev Nutov, Michael Segal |
Scheduling of Vehicles in Transportation Networks. |
Nets4Cars/Nets4Trains |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
Approximating some network design problems with node costs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating directed weighted-degree constrained networks. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko |
Approximating Minimum-Power Degree and Connectivity Problems. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Yuval Lando, Zeev Nutov, Michael Segal, Hanan Shpungin |
Novel algorithms for the network lifetime problem in wireless settings. |
Wireless Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating subset $k$-connectivity problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Guy Kortsarz, Zeev Nutov |
Steiner Forest Orientation Problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
Combinatorial Algorithms for Capacitated Network Design |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Nachshon Cohen, Zeev Nutov |
Approximating minimum-power edge-multicovers |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Johnny David, Zeev Nutov |
Approximating survivable networks with β-metric costs. |
J. Discrete Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Subset k-Connectivity Problems. |
WAOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
Network-Design with Degree Constraints. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating minimum power covers of intersecting families and directed edge-connectivity problems. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Minimum-Power k-Connectivity. |
Ad Hoc & Sensor Wireless Networks |
2010 |
DBLP BibTeX RDF |
|
| 1 | Guy Kortsarz, Michael Langberg, Zeev Nutov |
Approximating Maximum Subgraphs without Short Cycles. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Maduel, Zeev Nutov |
Covering a laminar family by leaf to leaf links. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Steiner Networks with Node-Weights. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Lando, Zeev Nutov |
On minimum power connectivity problems. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
Prize-Collecting Steiner Network Problems. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lior Kamma, Zeev Nutov |
Approximating Survivable Networks with Minimum Number of Steiner Points. |
WAOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Ariel Yaroshevitch |
Wireless network design via 3-decompositions. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
A note on Rooted Survivable Networks. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Lando, Zeev Nutov |
Inapproximability of survivable networks. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, graphs, connectivity |
| 1 | Zeev Nutov |
Approximating connectivity augmentation problems. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
Approximating minimum-power edge-covers and 2, 3-connectivity. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Listing minimal edge-covers of intersecting families with applications to connectivity problems. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moran Feldman, Guy Kortsarz, Zeev Nutov |
Improved approximating algorithms for Directed Steiner Forest. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
An almost O(log k)-approximation for k-connected subgraphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Michael Segal |
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks. |
ALGOSENSORS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
Approximating Some Network Design Problems with Node Costs. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation |
| 1 | Zeev Nutov |
Approximating Node-Connectivity Augmentation Problems. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Generalized Steiner Network, Approximation algorithms |
| 1 | Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
Approximating Fault-Tolerant Group-Steiner Problems. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Daniel Reichman |
Approximating maximum satisfiable subsystems of linear equations of bounded width. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
On extremal k-outconnected graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
Tight approximation algorithm for connectivity augmentation problems. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
A note on two source location problems. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko |
Approximating Minimum-Power Degree and Connectivity Problems. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Steiner Networks with Node Weights. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Yuval Lando, Zeev Nutov, Michael Segal, Hanan Shpungin |
Novel Algorithms for the Network Lifetime Problem in Wireless Settings. |
ADHOC-NOW |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Minimum-Power k-Connectivity. |
ADHOC-NOW |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows. |
DIALM-POMC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Directed Weighted-Degree Constrained Networks. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Lando, Zeev Nutov |
Inapproximability of Survivable Networks. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Michael Langberg, Zeev Nutov |
Approximating Maximum Subgraphs without Short Cycles. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sharon Feldman, Guy Kortsarz, Zeev Nutov |
Improved approximation algorithms for directed Steiner forest. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Yuster, Raphael Yuster |
Approximation algorithms and hardness results for cycle packing problems. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
Cycle packing, edge-disjoint, approximation algorithms, hardness of approximation, integrality gap |
| 1 | Zeev Nutov, Raphael Yuster |
Packing directed cycles efficiently. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov |
Power optimization for connectivity problems. |
Math. Program. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Masao Tsugaki |
On (t, k)-shredders in k-connected graphs. |
Ars Comb. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Gilad Liberman, Zeev Nutov |
On shredders and vertex connectivity augmentation. |
J. Discrete Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Lando, Zeev Nutov |
On Minimum Power Connectivity Problems. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Israel Beniaminy, Zeev Nutov, Meir Ovadia |
Approximating Interval Scheduling Problems with Bounded Profits. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Israel Beniaminy, Raphael Yuster |
A (1-1/e)-approximation algorithm for the generalized assignment problem. |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Rooted Connectivity Augmentation Problems. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Rooted connectivity, Augmentation problems, Approximation algorithms, Hardness of approximation |
| 1 | Guy Kortsarz, Zeev Nutov |
Tight Approximation Algorithm for Connectivity Augmentation Problems. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yana Kortsarts, Guy Kortsarz, Zeev Nutov |
Greedy approximation algorithms for directed multicuts. |
Networks |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
Approximating k-node Connected Subgraphs via Critical Graphs. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Zeev Nutov, Raphael Yuster |
Approximation algorithms for cycle packing problems. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating connectivity augmentation problems. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov |
Power Optimization for Connectivity Problems. |
IPCO |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Raphael Yuster |
Packing Directed Cycles Efficiently. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yana Kortsarts, Guy Kortsarz, Zeev Nutov |
Approximation Algorithm for Directed Multicuts. |
WAOA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
Approximation algorithm for k-node connected subgraphs via critical graphs. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
Approximating Node Connectivity Problems via Set Covers. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Vertex connected spanning subgraph, Metric costs, Approximation algorithms |
| 1 | Zeev Nutov |
Approximating Rooted Connectivity Augmentation Problems. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Tibor Jordán, Zeev Nutov |
On Rooted Node-Connectivity Problems. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Michal Penn |
On Integrality, Stability and Composition of Dicycle Packings and Covers. |
J. Comb. Optim. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating multiroot 3-outconnected subgraphs. |
Networks |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
Approximating node connectivity problems via set covers. |
APPROX |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincenzo Auletta, Yefim Dinitz, Zeev Nutov, Domenico Parente |
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Yefim Dinitz, Zeev Nutov |
A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Multiroot 3-Outconnected Subgraphs. |
SODA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Tibor Jordán, Zeev Nutov |
Approximating k-outconnected Subgraph Problems. |
APPROX |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Michal Penn |
Faster approximation algorithms for weighted triconnectivity augmentation problems. |
Oper. Res. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yefim Dinitz, Zeev Nutov |
Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5. |
CIAC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Michal Penn |
on the Integral Dicycle Packings and Covers and the Linear ordering Polytope. |
Discrete Applied Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")