Zeev Nutov

From MaRDI portal
Person:260247

Available identifiers

zbMath Open nutov.zeevMaRDI QIDQ260247

List of research outcomes

PublicationDate of PublicationType
2-node-connectivity network design2024-03-01Paper
On rooted \(k\)-connectivity problems in quasi-bipartite digraphs2024-02-20Paper
An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths2024-01-12Paper
Practical budgeted submodular maximization2023-04-28Paper
https://portal.mardi4nfdi.de/entity/Q58745452023-02-07Paper
Bounded Degree Group Steiner Tree Problems2022-10-13Paper
Approximating activation edge-cover and facility location problems2022-08-25Paper
https://portal.mardi4nfdi.de/entity/Q50923792022-07-21Paper
Approximating \(k\)-connected \(m\)-dominating sets2022-06-01Paper
2-node-connectivity network design2022-03-22Paper
Approximation algorithms for connectivity augmentation problems2022-03-21Paper
On rooted \(k\)-connectivity problems in quasi-bipartite digraphs2022-03-21Paper
The minimum degree group Steiner problem2022-01-13Paper
A \(4+\epsilon\) approximation for \(k\)-connected subgraphs2021-10-28Paper
A polylogarithmic approximation algorithm for 2-edge-connected dominating set2021-10-19Paper
Covering users by a connected swarm efficiently2021-07-08Paper
On the tree augmentation problem2021-03-26Paper
A 4 + ε approximation for k-connected subgraphs2021-02-02Paper
https://portal.mardi4nfdi.de/entity/Q51117502020-05-27Paper
Improved approximation algorithms for minimum power covering problems2019-10-18Paper
https://portal.mardi4nfdi.de/entity/Q46339042019-05-06Paper
https://portal.mardi4nfdi.de/entity/Q46339052019-05-06Paper
Improved approximation algorithms for minimum power covering problems2019-01-15Paper
Erratum2018-11-13Paper
Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights2018-11-12Paper
Approximation algorithms and hardness results for cycle packing problems2018-11-05Paper
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 22018-11-05Paper
A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 22018-10-30Paper
Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems2018-10-19Paper
Approximating Steiner trees and forests with minimum number of Steiner points2018-10-17Paper
Improved approximation algorithms for minimum cost node-connectivity augmentation problems2018-06-01Paper
https://portal.mardi4nfdi.de/entity/Q46364432018-04-19Paper
LP-relaxations for tree augmentation2018-03-21Paper
Approximating source location and star survivable network problems2017-05-12Paper
https://portal.mardi4nfdi.de/entity/Q29696132017-03-22Paper
Approximating Source Location and Star Survivable Network Problems2016-10-21Paper
Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems2016-07-25Paper
On fixed cost \(k\)-flow problems2016-03-21Paper
Approximating Steiner Trees and Forests with Minimum Number of Steiner Points2015-11-20Paper
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design2015-10-08Paper
Approximating minimum power edge-multi-covers2015-09-28Paper
Degree constrained node-connectivity problems2015-01-19Paper
Approximating minimum-cost connectivity problems via uncrossable bifamilies2014-12-05Paper
Prize-collecting steiner network problems2014-12-05Paper
Approximating connectivity augmentation problems2014-11-18Paper
https://portal.mardi4nfdi.de/entity/Q29216682014-10-13Paper
https://portal.mardi4nfdi.de/entity/Q29217122014-10-13Paper
On Fixed Cost k-Flow Problems2014-09-02Paper
Approximating minimum-cost edge-covers of crossing biset-families2014-08-14Paper
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions2014-07-25Paper
Small \(\ell\)-edge-covers in \(k\)-connected graphs2014-04-22Paper
Steiner Forest Orientation Problems2014-01-21Paper
A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius2013-12-19Paper
Survivable network activation problems2013-12-11Paper
Approximating Survivable Networks with Minimum Number of Steiner Points2013-08-06Paper
On some network design problems with degree constraints2013-07-24Paper
Approximating subset \(k\)-connectivity problems2013-06-24Paper
A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\)2013-04-04Paper
https://portal.mardi4nfdi.de/entity/Q29201332012-10-24Paper
Improved approximation algorithms for maximum lifetime problems in wireless networks2012-10-11Paper
Steiner Forest Orientation Problems2012-09-25Paper
Approximating minimum power edge-multi-covers2012-09-10Paper
Approximating Subset k-Connectivity Problems2012-07-16Paper
Degree-Constrained Node-Connectivity2012-06-29Paper
Survivable Network Activation Problems2012-06-29Paper
Improved approximation algorithms for directed Steiner forest2012-05-11Paper
Approximating node-connectivity augmentation problems2012-04-26Paper
Approximating fault-tolerant group-Steiner problems2012-03-13Paper
A note on labeling schemes for graph connectivity2012-03-09Paper
Approximating some network design problems with node costs2011-09-12Paper
A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius2011-08-17Paper
Network-Design with Degree Constraints2011-08-17Paper
Approximating survivable networks with \(\beta \)-metric costs2011-07-29Paper
Approximating minimum-power degree and connectivity problems2011-07-01Paper
Approximating Steiner Networks with Node-Weights2011-04-04Paper
Approximating Maximum Subgraphs without Short Cycles2011-03-15Paper
Approximating directed weighted-degree constrained networks2011-02-21Paper
Approximating Survivable Networks with Minimum Number of Steiner Points2011-02-15Paper
A note on Rooted Survivable Networks2010-09-01Paper
Wireless network design via 3-decompositions2010-09-01Paper
Approximation algorithm for k-node connected subgraphs via critical graphs2010-08-15Paper
Covering a laminar family by leaf to leaf links2010-08-13Paper
Prize-Collecting Steiner Network Problems2010-06-22Paper
Approximating minimum power covers of intersecting families and directed edge-connectivity problems2010-06-07Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques2010-05-26Paper
On minimum power connectivity problems2010-05-25Paper
Approximating maximum satisfiable subsystems of linear equations of bounded width2010-04-19Paper
Approximating Some Network Design Problems with Node Costs2009-10-28Paper
Approximating Node-Connectivity Augmentation Problems2009-10-28Paper
Approximating minimum-power edge-covers and 2,3-connectivity2009-06-24Paper
Inapproximability of survivable networks2009-05-28Paper
A note on two source location problems2009-05-13Paper
https://portal.mardi4nfdi.de/entity/Q36249682009-05-06Paper
Tight Approximation Algorithm for Connectivity Augmentation Problems2009-03-12Paper
Listing minimal edge-covers of intersecting families with applications to connectivity problems2009-03-04Paper
Approximating Maximum Subgraphs without Short Cycles2008-11-27Paper
Inapproximability of Survivable Networks2008-11-27Paper
Approximating Directed Weighted-Degree Constrained Networks2008-11-27Paper
On Minimum Power Connectivity Problems2008-09-25Paper
Approximating Interval Scheduling Problems with Bounded Profits2008-09-25Paper
Tight approximation algorithm for connectivity augmentation problems2008-06-26Paper
On shredders and vertex connectivity augmentation2008-05-16Paper
On extremal \(k\)-outconnected graphs2008-05-13Paper
Approximating Steiner Networks with Node Weights2008-04-15Paper
Approximating Minimum-Power Degree and Connectivity Problems2008-04-15Paper
Power Optimization for Connectivity Problems2007-08-30Paper
Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems2007-08-28Paper
Power optimization for connectivity problems2007-04-19Paper
Packing directed cycles efficiently2007-02-19Paper
A \((1-1/e)\)-approximation algorithm for the generalized assignment problem2006-06-30Paper
Approximating rooted connectivity augmentation problems2006-06-14Paper
Approximation and Online Algorithms2005-12-14Paper
Approximating k-node Connected Subgraphs via Critical Graphs2005-10-28Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
Greedy approximation algorithms for directed multicuts2005-08-05Paper
Approximating node connectivity problems via set covers2004-03-11Paper
https://portal.mardi4nfdi.de/entity/Q47807852002-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42340992002-01-29Paper
https://portal.mardi4nfdi.de/entity/Q27537402001-11-11Paper
On rooted node-connectivity problems2001-10-14Paper
A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs2001-01-07Paper
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph2000-12-18Paper
https://portal.mardi4nfdi.de/entity/Q45202412000-12-12Paper
On integrality, stability and composition of dicycle packings and covers2000-10-30Paper
https://portal.mardi4nfdi.de/entity/Q42524261999-06-17Paper
Faster approximation algorithms for weighted triconnectivity augmentation problems1999-03-23Paper
https://portal.mardi4nfdi.de/entity/Q44008461998-08-02Paper
On Mobile Robots Flow In Locally Uniform Networks1998-03-17Paper
Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs1997-11-12Paper
On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope1996-07-28Paper
On the integral dicycle packings and covers and the linear ordering polytope1995-07-24Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Zeev Nutov