Zeev Nutov

Orcid: 0000-0002-6629-3243

According to our database1, Zeev Nutov authored at least 133 papers between 1995 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

1995
2000
2005
2010
2015
2020
2025
0
5
10
15
3
1
1
4
6
5
2
1
3
6
4
2
3
2
7
11
8
6
7
4
5
2
2
1
1
2
2
1
1
3
2
1
1
3
1
1
2
2
4
1
1
1
1
2
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
A 22k-approximation algorithm for minimum power k edge disjoint st-paths.
Inf. Process. Lett., 2025

2024
Approximation algorithms for node and element connectivity augmentation problems.
Theory Comput. Syst., October, 2024

On Rooted k-Connectivity Problems in Quasi-Bipartite Digraphs.
Oper. Res. Forum, March, 2024

2-node-connectivity network design.
Theor. Comput. Sci., 2024

Improved approximation ratio for covering pliable set families.
CoRR, 2024

Extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families.
Proceedings of the Integer Programming and Combinatorial Optimization, 2024

Parameterized Algorithms for Node Connectivity Augmentation Problems.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

A 1.5-Approximation Algorithm for Activating Two Disjoint st-Paths.
Proceedings of the Algorithmics of Wireless Networks - 20th International Symposium, 2024

2023
Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and Experiments.
IEEE/ACM Trans. Netw., December, 2023

Practical Budgeted Submodular Maximization.
Algorithmica, May, 2023

Doing their best: How to provide service by limited number of drones?
Wirel. Networks, 2023

A logarithmic approximation algorithm for the activation edge multicover problem.
CoRR, 2023

A 1.5-pproximation algorithms for activating 2 disjoint st-paths.
CoRR, 2023

Improved approximation algorithms for some capacitated k edge connectivity problems.
CoRR, 2023

Improved Approximations for Relative Survivable Network Design.
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths.
Proceedings of the Unity of Logic and Computation, 2023

2022
Approximating activation edge-cover and facility location problems.
Theor. Comput. Sci., 2022

A 4 + <i>ϵ</i> approximation for <i>k</i>-connected subgraphs.
J. Comput. Syst. Sci., 2022

A polylogarithmic approximation algorithm for 2-edge-connected dominating set.
Inf. Process. Lett., 2022

The minimum degree Group Steiner problem.
Discret. Appl. Math., 2022

Approximating k-Connected m-Dominating Sets.
Algorithmica, 2022

Data Structures for Node Connectivity Queries.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Data structure for node connectivity queries.
CoRR, 2021

On the Tree Augmentation Problem.
Algorithmica, 2021

Approximation Algorithms for Connectivity Augmentation Problems.
Proceedings of the Computer Science - Theory and Applications, 2021

2020
Practical Budgeted Submodular Maximization.
CoRR, 2020

A 4 + <i>ε</i> approximation for <i>k</i>-connected subgraphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Bounded Degree Group Steiner Tree Problems.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Covering Users by a Connected Swarm Efficiently.
Proceedings of the Algorithms for Sensor Systems, 2020

2019
Improved approximation algorithms for minimum power covering problems.
Theor. Comput. Sci., 2019

An Õ(log<sup>2</sup>n)-approximation algorithm for 2-edge-connected dominating set.
CoRR, 2019

A (4+ε)-approximation for k-connected subgraphs.
CoRR, 2019

2018
Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies.
ACM Trans. Algorithms, 2018

Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems.
Theory Comput. Syst., 2018

Approximating Steiner trees and forests with minimum number of Steiner points.
J. Comput. Syst. Sci., 2018

Improved approximation algorithms for <i>k</i>-connected <i>m</i>-dominating set problems.
Inf. Process. Lett., 2018

LP-relaxations for tree augmentation.
Discret. Appl. Math., 2018

Approximating activation edge-cover and facility location problems.
CoRR, 2018

Activation Network Design Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Node-Connectivity Survivable Network Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

The k-Connected Subgraph Problem.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Approximating source location and star survivable network problems.
Theor. Comput. Sci., 2017

Improved Approximation Algorithm for Steiner <i>k</i>-Forest with Nearly Uniform Weights.
ACM Trans. Algorithms, 2017

A Note on the Tree Augmentation Problem.
CoRR, 2017

Improved approximation algorithms for k-connected m-dominating set problems.
CoRR, 2017

2016
A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2.
ACM Trans. Algorithms, 2016

On Fixed Cost k-Flow Problems.
Theory Comput. Syst., 2016

Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems.
Proceedings of the Computer Science - Theory and Applications, 2016

2015
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design.
SIAM J. Comput., 2015

Approximating minimum power edge-multi-covers.
J. Comb. Optim., 2015

A 1.75 LP approximation for the Tree Augmentation Problem.
CoRR, 2015

2014
Approximating minimum-cost edge-covers of crossing biset-families.
Comb., 2014

Degree Constrained Node-Connectivity Problems.
Algorithmica, 2014

Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights.
Proceedings of the Approximation, 2014

2013
MMM: multi-channel TDMA with MPR capabilities for MANETs.
Wirel. Networks, 2013

Survivable network activation problems.
Theor. Comput. Sci., 2013

A (1+ln2)(1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius.
Theor. Comput. Sci., 2013

Steiner Forest Orientation Problems.
SIAM J. Discret. Math., 2013

On some network design problems with degree constraints.
J. Comput. Syst. Sci., 2013

Small <i>ℓ</i>ℓ-edge-covers in <i>k</i>k-connected graphs.
Discret. Appl. Math., 2013

Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points
CoRR, 2013

2012
Improved approximation algorithms for maximum lifetime problems in wireless networks.
Theor. Comput. Sci., 2012

Approximating fault-tolerant group-Steiner problems.
Theor. Comput. Sci., 2012

Approximating minimum-cost connectivity problems via uncrossable bifamilies.
ACM Trans. Algorithms, 2012

Prize-collecting steiner network problems.
ACM Trans. Algorithms, 2012

Approximating survivable networks with minimum number of steiner points.
Networks, 2012

Approximating subset k-connectivity problems.
J. Discrete Algorithms, 2012

Improved approximation algorithms for Directed Steiner Forest.
J. Comput. Syst. Sci., 2012

A note on labeling schemes for graph connectivity.
Inf. Process. Lett., 2012

A unified approach to source location via rooted network augmentation
CoRR, 2012

Small ℓ-edge-covers in k-connected graphs
CoRR, 2012

Approximating Node-Connectivity Augmentation Problems.
Algorithmica, 2012

Scheduling of Vehicles in Transportation Networks.
Proceedings of the Communication Technologies for Vehicles - 4th International Workshop, 2012

Degree-Constrained Node-Connectivity.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
Novel algorithms for the network lifetime problem in wireless settings.
Wirel. Networks, 2011

Approximating directed weighted-degree constrained networks.
Theor. Comput. Sci., 2011

Approximating some network design problems with node costs.
Theor. Comput. Sci., 2011

Approximating survivable networks with β-metric costs.
J. Discrete Algorithms, 2011

A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
Inf. Process. Lett., 2011

Combinatorial Algorithms for Capacitated Network Design
CoRR, 2011

Approximating minimum-power edge-multicovers
CoRR, 2011

Approximating Minimum-Power Degree and Connectivity Problems.
Algorithmica, 2011

Network-Design with Degree Constraints.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Approximating minimum power covers of intersecting families and directed edge-connectivity problems.
Theor. Comput. Sci., 2010

Approximating Maximum Subgraphs without Short Cycles.
SIAM J. Discret. Math., 2010

Approximating Steiner Networks with Node-Weights.
SIAM J. Comput., 2010

On minimum power connectivity problems.
J. Discrete Algorithms, 2010

Covering a laminar family by leaf to leaf links.
Discret. Appl. Math., 2010

Approximating Minimum-Power k-Connectivity.
Ad Hoc Sens. Wirel. Networks, 2010

2009
Inapproximability of survivable networks.
Theor. Comput. Sci., 2009

Approximating connectivity augmentation problems.
ACM Trans. Algorithms, 2009

A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
ACM Trans. Algorithms, 2009

Wireless network design via 3-decompositions.
Inf. Process. Lett., 2009

A note on Rooted Survivable Networks.
Inf. Process. Lett., 2009

Listing minimal edge-covers of intersecting families with applications to connectivity problems.
Discret. Appl. Math., 2009

Approximating minimum-power edge-covers and 2, 3-connectivity.
Discret. Appl. Math., 2009

An almost <i>O</i>(log <i>k</i>)-approximation for <i>k</i>-connected subgraphs.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Improved approximating algorithms for Directed Steiner Forest.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Approximating minimum cost connectivity problems.
Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009

2008
A note on two source location problems.
J. Discrete Algorithms, 2008

Tight approximation algorithm for connectivity augmentation problems.
J. Comput. Syst. Sci., 2008

Approximating maximum satisfiable subsystems of linear equations of bounded width.
Inf. Process. Lett., 2008

On extremal k-outconnected graphs.
Discret. Math., 2008

Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2008

2007
Approximating Minimum-Cost Connectivity Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Approximation algorithms and hardness results for cycle packing problems.
ACM Trans. Algorithms, 2007

Power optimization for connectivity problems.
Math. Program., 2007

On shredders and vertex connectivity augmentation.
J. Discrete Algorithms, 2007

Packing directed cycles efficiently.
Discret. Appl. Math., 2007

On (t, k)-shredders in k-connected graphs.
Ars Comb., 2007

Approximating Interval Scheduling Problems with Bounded Profits.
Proceedings of the Algorithms, 2007

2006
A (1-1/<i>e</i>)-approximation algorithm for the generalized assignment problem.
Oper. Res. Lett., 2006

Approximating Rooted Connectivity Augmentation Problems.
Algorithmica, 2006

Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems.
Proceedings of the Approximation, 2006

2005
Approximating <i>k</i>-node Connected Subgraphs via Critical Graphs.
SIAM J. Comput., 2005

Greedy approximation algorithms for directed multicuts.
Networks, 2005

Approximation algorithms for cycle packing problems.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Approximation Algorithm for Directed Multicuts.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Approximation algorithm for k-node connected subgraphs via critical graphs.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

2003
Approximating Node Connectivity Problems via Set Covers.
Algorithmica, 2003

2001
On Rooted Node-Connectivity Problems.
Algorithmica, 2001

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.
Proceedings of the Approximation, 2001

2000
Approximating multiroot 3-outconnected subgraphs.
Networks, 2000

On Integrality, Stability and Composition of Dicycle Packings and Covers.
J. Comb. Optim., 2000

1999
A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs.
J. Algorithms, 1999

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph.
J. Algorithms, 1999

1998
Approximating <i>k</i>-outconnected Subgraph Problems.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997
Faster approximation algorithms for weighted triconnectivity augmentation problems.
Oper. Res. Lett., 1997

Finding Optimum <i>k</i>-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for <i>k</i>=3, 4, 5.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1995
on the Integral Dicycle Packings and Covers and the Linear ordering Polytope.
Discret. Appl. Math., 1995

A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995


  Loading...