default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZeev Nutov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j80]Zeev Nutov
:
On Rooted k-Connectivity Problems in Quasi-Bipartite Digraphs. Oper. Res. Forum 5(1): 10 (2024)- [j79]Zeev Nutov:
2-node-connectivity network design. Theor. Comput. Sci. 987: 114367 (2024) - [c63]Zeev Nutov:
Parameterized Algorithms for Node Connectivity Augmentation Problems. ESA 2024: 92:1-92:12 - [c62]Zeev Nutov:
Extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families. IPCO 2024: 351-364 - [i32]Zeev Nutov:
Improved approximation ratio for covering pliable set families. CoRR abs/2404.00683 (2024) - 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) - [c61]Zeev Nutov:
An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths. CiE 2023: 287-296 - [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) - [i30]Zeev Nutov:
Improved approximation algorithms for some capacitated k edge connectivity problems. CoRR abs/2307.01650 (2023) - [i29]Zeev Nutov:
Extending the primal-dual 2-approximation algorithm beyond uncrossable set families. CoRR abs/2307.08270 (2023) - [i28]Zeev Nutov, Dawod Kahba:
A 1.5-pproximation algorithms for activating 2 disjoint st-paths. CoRR abs/2307.12646 (2023) - [i27]Zeev Nutov:
A logarithmic approximation algorithm for the activation edge multicover problem. CoRR abs/2308.02901 (2023) - 2022
- [j75]Zeev Nutov:
Approximating k-Connected m-Dominating Sets. Algorithmica 84(6): 1511-1525 (2022) - [j74]Guy Kortsarz, Zeev Nutov:
The minimum degree Group Steiner problem. Discret. Appl. Math. 309: 229-239 (2022) - [j73]Amir Belgi, Zeev Nutov:
A polylogarithmic approximation algorithm for 2-edge-connected dominating set. Inf. Process. Lett. 173: 106175 (2022) - [j72]Zeev Nutov:
A 4 + ϵ approximation for k-connected subgraphs. J. Comput. Syst. Sci. 123: 64-75 (2022) - [j71]Guy Kortsarz, Zeev Nutov, Eli Shalom:
Approximating activation edge-cover and facility location problems. Theor. Comput. Sci. 930: 218-228 (2022) - [c59]Zeev Nutov:
Data Structures for Node Connectivity Queries. ESA 2022: 82:1-82:12 - [i26]Zeev Nutov:
An $O(\sqrt{k})$-approximation algorithm for minimum power $k$ edge disjoint $st$ -paths. CoRR abs/2208.09373 (2022) - [i25]Zeev Nutov:
Parameterized algorithms for node connectivity augmentation problems. CoRR abs/2209.06695 (2022) - 2021
- [j70]Zeev Nutov:
On the Tree Augmentation Problem. Algorithmica 83(2): 553-575 (2021) - [c58]Zeev Nutov:
Approximation Algorithms for Connectivity Augmentation Problems. CSR 2021: 321-338 - [c57]Zeev Nutov:
On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs. CSR 2021: 339-348 - [i24]Zeev Nutov:
Data structure for node connectivity queries. CoRR abs/2110.09102 (2021) - 2020
- [c56]Kiril Danilchenko, Michael Segal, Zeev Nutov:
Covering Users by a Connected Swarm Efficiently. ALGOSENSORS 2020: 32-44 - [c55]Zeev Nutov:
Approximating k-Connected m-Dominating Sets. ESA 2020: 73:1-73:14 - [c54]Guy Kortsarz, Zeev Nutov:
Bounded Degree Group Steiner Tree Problems. IWOCA 2020: 343-354 - [c53]Zeev Nutov:
A 4 + ε approximation for k-connected subgraphs. SODA 2020: 1000-1009 - [c52]Zeev Nutov:
2-Node-Connectivity Network Design. WAOA 2020: 220-235 - [i23]Zeev Nutov:
2-node-connectivity network design. CoRR abs/2002.04048 (2020) - [i22]Zeev Nutov, Elad Shoham:
Practical Budgeted Submodular Maximization. CoRR abs/2007.04937 (2020) - [i21]Zeev Nutov:
On rooted k-connectivity problems in quasi-bipartite digraphs. CoRR abs/2009.10160 (2020) - [i20]Zeev Nutov:
Approximation algorithms for connectivity augmentation problems. CoRR abs/2009.13257 (2020)
2010 – 2019
- 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 - [i19]Zeev Nutov:
A (4+ε)-approximation for k-connected subgraphs. CoRR abs/1901.07246 (2019) - [i18]Zeev Nutov:
Approximating $k$-connected $m$-dominating sets. CoRR abs/1902.03548 (2019) - [i17]Guy Kortsarz, Zeev Nutov:
Bounded Degree Group Steiner Tree Problems. CoRR abs/1910.12848 (2019) - [i16]Amir Belgi, Zeev Nutov:
An Õ(log2n)-approximation algorithm for 2-edge-connected dominating set. CoRR abs/1912.09662 (2019) - 2018
- [j68]Guy Kortsarz, Zeev Nutov:
LP-relaxations for tree augmentation. Discret. Appl. Math. 239: 94-105 (2018) - [j67]Zeev Nutov:
Improved approximation algorithms for k-connected m-dominating set problems. Inf. Process. Lett. 140: 30-33 (2018) - [j66]Nachshon Cohen, Zeev Nutov:
Approximating Steiner trees and forests with minimum number of Steiner points. J. Comput. Syst. Sci. 98: 53-64 (2018) - [j65]Zeev Nutov:
Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems. Theory Comput. Syst. 62(3): 510-532 (2018) - [j64]Zeev Nutov:
Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies. ACM Trans. Algorithms 14(3): 37:1-37:8 (2018) - [c50]Gruia Calinescu, Guy Kortsarz, Zeev Nutov:
Improved Approximation Algorithms for Minimum Power Covering Problems. WAOA 2018: 134-148 - [p3]Zeev Nutov:
The k-Connected Subgraph Problem. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [p2]Zeev Nutov:
Node-Connectivity Survivable Network Problems. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [p1]Zeev Nutov:
Activation Network Design Problems. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [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) - [c49]Zeev Nutov:
On the Tree Augmentation Problem. ESA 2017: 61:1-61:14 - [i14]Zeev Nutov:
Improved approximation algorithms for k-connected m-dominating set problems. CoRR abs/1703.04230 (2017) - [i13]Zeev Nutov:
A Note on the Tree Augmentation Problem. CoRR abs/1703.07247 (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 - [c47]Zeev Nutov:
Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems. CSR 2016: 324-339 - 2015
- [j59]Nachshon Cohen, Zeev Nutov:
Approximating minimum power edge-multi-covers. J. Comb. Optim. 30(3): 563-578 (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
- [j57]Zeev Nutov:
Degree Constrained Node-Connectivity Problems. Algorithmica 70(2): 340-364 (2014) - [j56]Zeev Nutov:
Approximating minimum-cost edge-covers of crossing biset-families. Comb. 34(1): 95-114 (2014) - [c45]Michael Dinitz, Guy Kortsarz, Zeev Nutov:
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. APPROX-RANDOM 2014: 115-127 - [c44]Nachshon Cohen, Zeev Nutov:
Approximating Steiner Trees and Forests with Minimum Number of Steiner Points. WAOA 2014: 95-106 - 2013
- [j55]Zeev Nutov:
Small ℓℓ-edge-covers in kk-connected graphs. Discret. Appl. Math. 161(13-14): 2101-2106 (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) - [j52]Nachshon Cohen, Zeev Nutov:
A (1+ln2)(1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius. Theor. Comput. Sci. 489-490: 67-74 (2013) - [j51]Zeev Nutov:
Survivable network activation problems. Theor. Comput. Sci. 514: 105-115 (2013) - [j50]Shimon Avadis, Anat Lerner, Zeev Nutov:
MMM: multi-channel TDMA with MPR capabilities for MANETs. Wirel. Networks 19(3): 323-330 (2013) - [c43]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On Fixed Cost k-Flow Problems. WAOA 2013: 49-60 - [i10]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]Zeev Nutov:
Approximating subset k-connectivity problems. J. Discrete Algorithms 17: 51-59 (2012) - [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 Trans. Algorithms 9(1): 1:1-1:16 (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) - [c42]Nachshon Cohen, Zeev Nutov:
Approximating Minimum Power Edge-Multi-Covers. CSR 2012: 64-75 - [c41]Marek Cygan, Guy Kortsarz, Zeev Nutov:
Steiner Forest Orientation Problems. ESA 2012: 361-372 - [c40]Zeev Nutov:
Degree-Constrained Node-Connectivity. LATIN 2012: 582-593 - [c39]Zeev Nutov:
Survivable Network Activation Problems. LATIN 2012: 594-605 - [c38]Dariusz R. Kowalski, Zeev Nutov, Michael Segal:
Scheduling of Vehicles in Transportation Networks. Nets4Cars/Nets4Trains 2012: 124-136 - [i9]Zeev Nutov:
Small ℓ-edge-covers in k-connected graphs. CoRR abs/1203.6274 (2012) - [i8]Zeev Nutov:
Approximating minimum-cost edge-covers of crossing biset-families. CoRR abs/1207.4366 (2012) - [i7]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. Wirel. 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]Zeev Nutov:
Approximating Subset k-Connectivity Problems. WAOA 2011: 9-20 - [i6]Zeev Nutov:
Approximating subset $k$-connectivity problems. CoRR abs/1105.4250 (2011) - [i5]Nachshon Cohen, Zeev Nutov:
Approximating minimum-power edge-multicovers. CoRR abs/1107.4893 (2011) - [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
- [j34]Zeev Nutov:
Approximating Minimum-Power k-Connectivity. Ad Hoc Sens. Wirel. Networks 9(1-2): 129-137 (2010) - [j33]Yael Maduel, Zeev Nutov:
Covering a laminar family by leaf to leaf links. Discret. Appl. Math. 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. Discret. 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
2000 – 2009
- 2009
- [j28]Zeev Nutov:
Listing minimal edge-covers of intersecting families with applications to connectivity problems. Discret. Appl. Math. 157(1): 112-117 (2009) - [j27]Guy Kortsarz, Zeev Nutov:
Approximating minimum-power edge-covers and 2, 3-connectivity. Discret. Appl. Math. 157(8): 1840-1847 (2009) - [j26]Zeev Nutov:
A note on Rooted Survivable Networks. Inf. Process. Lett. 109(19): 1114-1119 (2009) - [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 Trans. Algorithms 5(2): 21:1-21:17 (2009) - [j23]Zeev Nutov:
Approximating connectivity augmentation problems. ACM Trans. Algorithms 6(1): 5:1-5:19 (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.