Остановите войну!
for scientists:
default search action
Zeev Nutov
- > Home > Persons > Zeev Nutov
Publications
- 2023
- [j78]Moran Feldman, Zeev Nutov, Elad Shoham:
Practical Budgeted Submodular Maximization. Algorithmica 85(5): 1332-1371 (2023) - [j77]Kiril Danilchenko, Zeev Nutov, Michael Segal:
Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and Experiments. IEEE/ACM Trans. Netw. 31(6): 2483-2498 (2023) - [j76]Kiril Danilchenko, Zeev Nutov, Michael Segal:
Doing their best: How to provide service by limited number of drones? Wirel. Networks 29(1): 209-220 (2023) - [c60]Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov:
Improved Approximations for Relative Survivable Network Design. WAOA 2023: 190-204 - [i31]Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov:
Improved Approximations for Relative Survivable Network Design. CoRR abs/2304.06656 (2023) - 2022
- [j74]Guy Kortsarz, Zeev Nutov:
The minimum degree Group Steiner problem. Discret. Appl. Math. 309: 229-239 (2022) - [j71]Guy Kortsarz, Zeev Nutov, Eli Shalom:
Approximating activation edge-cover and facility location problems. Theor. Comput. Sci. 930: 218-228 (2022) - 2020
- [c56]Kiril Danilchenko, Michael Segal, Zeev Nutov:
Covering Users by a Connected Swarm Efficiently. ALGOSENSORS 2020: 32-44 - [c54]Guy Kortsarz, Zeev Nutov:
Bounded Degree Group Steiner Tree Problems. IWOCA 2020: 343-354 - [i22]Zeev Nutov, Elad Shoham:
Practical Budgeted Submodular Maximization. CoRR abs/2007.04937 (2020) - 2019
- [j69]Gruia Calinescu, Guy Kortsarz, Zeev Nutov:
Improved approximation algorithms for minimum power covering problems. Theor. Comput. Sci. 795: 285-300 (2019) - [c51]Zeev Nutov, Guy Kortsarz, Eli Shalom:
Approximating Activation Edge-Cover and Facility Location Problems. MFCS 2019: 20:1-20:14 - [i17]Guy Kortsarz, Zeev Nutov:
Bounded Degree Group Steiner Tree Problems. CoRR abs/1910.12848 (2019) - 2018
- [j68]Guy Kortsarz, Zeev Nutov:
LP-relaxations for tree augmentation. Discret. Appl. Math. 239: 94-105 (2018) - [c50]Gruia Calinescu, Guy Kortsarz, Zeev Nutov:
Improved Approximation Algorithms for Minimum Power Covering Problems. WAOA 2018: 134-148 - [i15]Zeev Nutov, Eli Shalom:
Approximating activation edge-cover and facility location problems. CoRR abs/1812.09880 (2018) - 2017
- [j63]Michael Dinitz, Guy Kortsarz, Zeev Nutov:
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. ACM Trans. Algorithms 13(3): 40:1-40:16 (2017) - [j62]Guy Kortsarz, Zeev Nutov:
Approximating source location and star survivable network problems. Theor. Comput. Sci. 674: 32-42 (2017) - 2016
- [j61]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On Fixed Cost k-Flow Problems. Theory Comput. Syst. 58(1): 4-18 (2016) - [j60]Guy Kortsarz, Zeev Nutov:
A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2. ACM Trans. Algorithms 12(2): 23:1-23:20 (2016) - [c48]Guy Kortsarz, Zeev Nutov:
LP-Relaxations for Tree Augmentation. APPROX-RANDOM 2016: 13:1-13:16 - 2015
- [j58]Takuro Fukunaga, Zeev Nutov, R. Ravi:
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. SIAM J. Comput. 44(5): 1202-1229 (2015) - [c46]Guy Kortsarz, Zeev Nutov:
Approximating Source Location and Star Survivable Network Problems. WG 2015: 203-218 - [i12]Guy Kortsarz, Zeev Nutov:
A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. CoRR abs/1507.02799 (2015) - [i11]Guy Kortsarz, Zeev Nutov:
A 1.75 LP approximation for the Tree Augmentation Problem. CoRR abs/1507.03009 (2015) - 2014
- [c45]Michael Dinitz, Guy Kortsarz, Zeev Nutov:
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. APPROX-RANDOM 2014: 115-127 - 2013
- [j54]Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On some network design problems with degree constraints. J. Comput. Syst. Sci. 79(5): 725-736 (2013) - [j53]Marek Cygan, Guy Kortsarz, Zeev Nutov:
Steiner Forest Orientation Problems. SIAM J. Discret. Math. 27(3): 1503-1513 (2013) - [c43]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On Fixed Cost k-Flow Problems. WAOA 2013: 49-60 - 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) - [j43]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Prize-collecting steiner network problems. ACM Trans. Algorithms 9(1): 2:1-2:13 (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) - [c41]Marek Cygan, Guy Kortsarz, Zeev Nutov:
Steiner Forest Orientation Problems. ESA 2012: 361-372 - [c38]Dariusz R. Kowalski, Zeev Nutov, Michael Segal:
Scheduling of Vehicles in Transportation Networks. Nets4Cars/Nets4Trains 2012: 124-136 - 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) - [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. Wirel. Networks 17(2): 397-410 (2011) - [c36]Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Network-Design with Degree Constraints. APPROX-RANDOM 2011: 289-301 - [i4]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Combinatorial Algorithms for Capacitated Network Design. CoRR abs/1108.1176 (2011) - [i3]Marek Cygan, Guy Kortsarz, Zeev Nutov:
Steiner Forest Orientation Problems. CoRR abs/1112.2273 (2011) - 2010
- [j32]Yuval Lando, Zeev Nutov:
On minimum power connectivity problems. J. Discrete Algorithms 8(2): 164-173 (2010) - [j30]Guy Kortsarz, Michael Langberg, Zeev Nutov:
Approximating Maximum Subgraphs without Short Cycles. SIAM J. Discret. Math. 24(1): 255-269 (2010) - [c34]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Prize-Collecting Steiner Network Problems. IPCO 2010: 71-84 - 2009
- [j27]Guy Kortsarz, Zeev Nutov:
Approximating minimum-power edge-covers and 2, 3-connectivity. Discret. Appl. Math. 157(8): 1840-1847 (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 Trans. Algorithms 5(2): 21:1-21:17 (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 - [c28]Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Approximating Fault-Tolerant Group-Steiner Problems. FSTTCS 2009: 263-274 - [c26]Moran Feldman, Guy Kortsarz, Zeev Nutov:
Improved approximating algorithms for Directed Steiner Forest. SODA 2009: 922-931 - [i2]Guy Kortsarz, Zeev Nutov:
Approximating minimum cost connectivity problems. Parameterized complexity and approximation algorithms 2009 - 2008
- [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) - [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]Yuval Lando, Zeev Nutov:
Inapproximability of Survivable Networks. APPROX-RANDOM 2008: 146-152 - [c18]Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko:
Approximating Minimum-Power Degree and Connectivity Problems. LATIN 2008: 423-435 - 2007
- [j16]Zeev Nutov, Raphael Yuster:
Packing directed cycles efficiently. Discret. Appl. Math. 155(2): 82-91 (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 Verstraëte, Raphael Yuster:
Approximation algorithms and hardness results for cycle packing problems. ACM Trans. Algorithms 3(4): 48 (2007) - [c17]Yuval Lando, Zeev Nutov:
On Minimum Power Connectivity Problems. ESA 2007: 87-98 - [c16]Israel Beniaminy, Zeev Nutov, Meir Ovadia:
Approximating Interval Scheduling Problems with Bounded Profits. ESA 2007: 487-497 - [r1]Guy Kortsarz, Zeev Nutov:
Approximating Minimum-Cost Connectivity Problems. Handbook of Approximation Algorithms and Metaheuristics 2007 - [i1]Moran Feldman, Guy Kortsarz, Zeev Nutov:
Improved approximation algorithms for directed Steiner forest. Electron. Colloquium Comput. Complex. TR07 (2007) - 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) - [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 - [c11]Michael Krivelevich, Zeev Nutov, Raphael Yuster:
Approximation algorithms for cycle packing problems. SODA 2005: 556-561 - 2004
- [c10]Zeev Nutov, Raphael Yuster:
Packing Directed Cycles Efficiently. MFCS 2004: 310-321 - [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) - 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
- [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) - 1998
- [c3]Joseph Cheriyan, Tibor Jordán, Zeev Nutov:
Approximating k-outconnected Subgraph Problems. APPROX 1998: 77-88 - 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
- [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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-01-27 23:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint