Zeev Nutov

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 58

Top Venues

Publications

Zeev Nutov
2-node-connectivity network design. Theor. Comput. Sci. 987 (2024)
Zeev Nutov
On Rooted k-Connectivity Problems in Quasi-Bipartite Digraphs. Oper. Res. Forum 5 (1) (2024)
Zeev Nutov
Improved approximation ratio for covering pliable set families. CoRR (2024)
Zeev Nutov
Extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families. IPCO (2024)
Kiril Danilchenko, Zeev Nutov, Michael Segal
Doing their best: How to provide service by limited number of drones? Wirel. Networks 29 (1) (2023)
Zeev Nutov
A logarithmic approximation algorithm for the activation edge multicover problem. CoRR (2023)
Zeev Nutov, Dawod Kahba
A 1.5-pproximation algorithms for activating 2 disjoint st-paths. CoRR (2023)
Zeev Nutov
Improved approximation algorithms for some capacitated k edge connectivity problems. CoRR (2023)
Zeev Nutov
An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths. CiE (2023)
Moran Feldman, Zeev Nutov, Elad Shoham
Practical Budgeted Submodular Maximization. Algorithmica 85 (5) (2023)
Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov
Improved Approximations for Relative Survivable Network Design. CoRR (2023)
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) (2023)
Zeev Nutov
Extending the primal-dual 2-approximation algorithm beyond uncrossable set families. CoRR (2023)
Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov
Improved Approximations for Relative Survivable Network Design. WAOA (2023)
Zeev Nutov
-connected subgraphs. J. Comput. Syst. Sci. 123 (2022)
Guy Kortsarz, Zeev Nutov, Eli Shalom
Approximating activation edge-cover and facility location problems. Theor. Comput. Sci. 930 (2022)
Guy Kortsarz, Zeev Nutov
The minimum degree Group Steiner problem. Discret. Appl. Math. 309 (2022)
Zeev Nutov
Parameterized algorithms for node connectivity augmentation problems. CoRR (2022)
Zeev Nutov
Approximating k-Connected m-Dominating Sets. Algorithmica 84 (6) (2022)
Zeev Nutov
An $O(\sqrt{k})$-approximation algorithm for minimum power $k$ edge disjoint $st$ -paths. CoRR (2022)
Zeev Nutov
Data Structures for Node Connectivity Queries. ESA (2022)
Amir Belgi, Zeev Nutov
A polylogarithmic approximation algorithm for 2-edge-connected dominating set. Inf. Process. Lett. 173 (2022)
Zeev Nutov
$k$ disjoint $st$-paths activation in polynomial time. CoRR (2021)
Zeev Nutov
Data structure for node connectivity queries. CoRR (2021)
Zeev Nutov
On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs. CSR (2021)
Zeev Nutov
Approximation Algorithms for Connectivity Augmentation Problems. CSR (2021)
Zeev Nutov
On the Tree Augmentation Problem. Algorithmica 83 (2) (2021)
Zeev Nutov
2-node-connectivity network design. CoRR (2020)
Zeev Nutov, Elad Shoham
Practical Budgeted Submodular Maximization. CoRR (2020)
Zeev Nutov
Approximation algorithms for connectivity augmentation problems. CoRR (2020)
Zeev Nutov
2-Node-Connectivity Network Design. WAOA (2020)
Zeev Nutov
On rooted k-connectivity problems in quasi-bipartite digraphs. CoRR (2020)
Zeev Nutov
Approximating k-Connected m-Dominating Sets. ESA (2020)
Zeev Nutov
-connected subgraphs. SODA (2020)
Guy Kortsarz, Zeev Nutov
Bounded Degree Group Steiner Tree Problems. IWOCA (2020)
Kiril Danilchenko, Michael Segal, Zeev Nutov
Covering Users by a Connected Swarm Efficiently. ALGOSENSORS (2020)
Zeev Nutov, Guy Kortsarz, Eli Shalom
Approximating Activation Edge-Cover and Facility Location Problems. MFCS (2019)
Gruia Calinescu, Guy Kortsarz, Zeev Nutov
Improved approximation algorithms for minimum power covering problems. Theor. Comput. Sci. 795 (2019)
Amir Belgi, Zeev Nutov
n)-approximation algorithm for 2-edge-connected dominating set. CoRR (2019)
Zeev Nutov
Approximating $k$-connected $m$-dominating sets. CoRR (2019)
Guy Kortsarz, Zeev Nutov
Bounded Degree Group Steiner Tree Problems. CoRR (2019)
Zeev Nutov
A (4+ε)-approximation for k-connected subgraphs. CoRR (2019)
Zeev Nutov
Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies. ACM Trans. Algorithms 14 (3) (2018)
Guy Kortsarz, Zeev Nutov
LP-relaxations for tree augmentation. Discret. Appl. Math. 239 (2018)
Gruia Calinescu, Guy Kortsarz, Zeev Nutov
Improved Approximation Algorithms for Minimum Power Covering Problems. WAOA (2018)
Zeev Nutov
-dominating set problems. Inf. Process. Lett. 140 (2018)
Zeev Nutov
Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems. Theory Comput. Syst. 62 (3) (2018)
Zeev Nutov, Eli Shalom
Approximating activation edge-cover and facility location problems. CoRR (2018)
Nachshon Cohen, Zeev Nutov
Approximating Steiner trees and forests with minimum number of Steiner points. J. Comput. Syst. Sci. 98 (2018)
Zeev Nutov
On the Tree Augmentation Problem. ESA (2017)
Zeev Nutov
Improved approximation algorithms for k-connected m-dominating set problems. CoRR (2017)
Guy Kortsarz, Zeev Nutov
Approximating source location and star survivable network problems. Theor. Comput. Sci. 674 (2017)
Zeev Nutov
A Note on the Tree Augmentation Problem. CoRR (2017)
Michael Dinitz, Guy Kortsarz, Zeev Nutov
-Forest with Nearly Uniform Weights. ACM Trans. Algorithms 13 (3) (2017)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
On Fixed Cost k-Flow Problems. Theory Comput. Syst. 58 (1) (2016)
Guy Kortsarz, Zeev Nutov
LP-Relaxations for Tree Augmentation. APPROX-RANDOM (2016)
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) (2016)
Zeev Nutov
Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems. CSR (2016)
Guy Kortsarz, Zeev Nutov
A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. CoRR (2015)
Guy Kortsarz, Zeev Nutov
Approximating Source Location and Star Survivable Network Problems. WG (2015)
Guy Kortsarz, Zeev Nutov
A 1.75 LP approximation for the Tree Augmentation Problem. CoRR (2015)
Nachshon Cohen, Zeev Nutov
Approximating minimum power edge-multi-covers. J. Comb. Optim. 30 (3) (2015)
Takuro Fukunaga, Zeev Nutov, R. Ravi
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. SIAM J. Comput. 44 (5) (2015)
Zeev Nutov
Degree Constrained Node-Connectivity Problems. Algorithmica 70 (2) (2014)
Michael Dinitz, Guy Kortsarz, Zeev Nutov
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. APPROX-RANDOM (2014)
Nachshon Cohen, Zeev Nutov
Approximating Steiner Trees and Forests with Minimum Number of Steiner Points. WAOA (2014)
Zeev Nutov
Approximating minimum-cost edge-covers of crossing biset-families. Comb. 34 (1) (2014)
Marek Cygan, Guy Kortsarz, Zeev Nutov
Steiner Forest Orientation Problems. SIAM J. Discret. Math. 27 (3) (2013)
Shimon Avadis, Anat Lerner, Zeev Nutov
MMM: multi-channel TDMA with MPR capabilities for MANETs. Wirel. Networks 19 (3) (2013)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
On Fixed Cost k-Flow Problems. WAOA (2013)
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
On some network design problems with degree constraints. J. Comput. Syst. Sci. 79 (5) (2013)
Zeev Nutov
Survivable network activation problems. Theor. Comput. Sci. 514 (2013)
Zeev Nutov
k-connected graphs. Discret. Appl. Math. 161 (13-14) (2013)
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. (2013)
Nachshon Cohen, Zeev Nutov
Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points CoRR (2013)
Zeev Nutov
Approximating minimum-cost edge-covers of crossing biset-families CoRR (2012)
Nachshon Cohen, Zeev Nutov
Approximating Minimum Power Edge-Multi-Covers. CSR (2012)
Zeev Nutov
Approximating Node-Connectivity Augmentation Problems. Algorithmica 63 (1-2) (2012)
Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
Prize-collecting steiner network problems. ACM Trans. Algorithms 9 (1) (2012)
Dariusz R. Kowalski, Zeev Nutov, Michael Segal
Scheduling of Vehicles in Transportation Networks. Nets4Cars/Nets4Trains (2012)
Zeev Nutov
Approximating subset k-connectivity problems. J. Discrete Algorithms 17 (2012)
Zeev Nutov
Approximating minimum-cost connectivity problems via uncrossable bifamilies. ACM Trans. Algorithms 9 (1) (2012)
Zeev Nutov
Degree-Constrained Node-Connectivity. LATIN (2012)
Zeev Nutov
Survivable Network Activation Problems. LATIN (2012)
Zeev Nutov
A unified approach to source location via rooted network augmentation CoRR (2012)
Zeev Nutov
Small ℓ-edge-covers in k-connected graphs CoRR (2012)
Zeev Nutov, Michael Segal
Improved approximation algorithms for maximum lifetime problems in wireless networks. Theor. Comput. Sci. 453 (2012)
Moran Feldman, Guy Kortsarz, Zeev Nutov
Improved approximation algorithms for Directed Steiner Forest. J. Comput. Syst. Sci. 78 (1) (2012)
Lior Kamma, Zeev Nutov
Approximating survivable networks with minimum number of steiner points. Networks 60 (4) (2012)
Rani Izsak, Zeev Nutov
A note on labeling schemes for graph connectivity. Inf. Process. Lett. 112 (1-2) (2012)
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
Approximating fault-tolerant group-Steiner problems. Theor. Comput. Sci. 416 (2012)
Marek Cygan, Guy Kortsarz, Zeev Nutov
Steiner Forest Orientation Problems. ESA (2012)
Marek Cygan, Guy Kortsarz, Zeev Nutov
Steiner Forest Orientation Problems CoRR (2011)
Zeev Nutov
Approximating Subset k-Connectivity Problems. WAOA (2011)
Guy Kortsarz, Zeev Nutov
Approximating some network design problems with node costs. Theor. Comput. Sci. 412 (35) (2011)
Zeev Nutov
Approximating directed weighted-degree constrained networks. Theor. Comput. Sci. 412 (8-10) (2011)
Nachshon Cohen, Zeev Nutov
Approximating minimum-power edge-multicovers CoRR (2011)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
Combinatorial Algorithms for Capacitated Network Design CoRR (2011)
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) (2011)
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)

Zeev Nutov.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Zeev Nutov