Searching for authors named "Zeev Nutov" – sorted by Relevance.
-
Approximating Steiner Networks with Node Weights
- Approximating Steiner Networks with Node Weights Zeev Nutov The Open University of Israel nutov
- Cited by 2 (2 self) – Add To MetaCart
-
Improved Approximation Algorithms for Finding Optimum k-Vertex Connected Spanning Subgraphs
- Improved Approximation Algorithms for Finding Optimum k-Vertex Connected Spanning Subgraphs Zeev
- Cited by 2 (2 self) – Add To MetaCart
-
Approximating Multiroot 3-Outconnected Subgraphs
- Approximating multiroot 3-outconnected subgraphs Zeev Nutov Abstract The multiroot k
- Cited by 1 (0 self) – Add To MetaCart
-
Packing directed cycles efficiently
- Packing Directed Cycles Efficiently ∗ Raphael Yuster † Zeev Nutov ‡ Abstract Let G be a simple
- Cited by 2 (1 self) – Add To MetaCart
-
A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
- Dinitz y Zeev Nutov zx Abstract The problem of finding a minimum weight k-vertex connected spanning
- Cited by 15 (5 self) – Add To MetaCart
-
Approximating minimum cost connectivity problems
- , Camden guyk@(email omitted); Zeev Nutov The Open University of Israel nutov@(email omitted); We survey
- Cited by 12 (7 self) – Add To MetaCart
-
unknown title
- Even# Jon Feldman## Guy Kortsarz$ Zeev Nutov || October 5, 2006 Abstract We present a 1
- Add To MetaCart
-
unknown title
- Even# Jon Feldman## Guy Kortsarz$ Zeev Nutov|| October 20, 2008 Abstract We present a 1
- Add To MetaCart
-
Approximating Maximum Subgraphs Without Short Cycles
- Approximating Maximum Subgraphs Without Short Cycles Guy Kortsarz * Michael Langberg # Zeev
- Add To MetaCart
-
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 (Extended Abstract)
- , and Zeev Nutov 3 1 Dept. of Electrical Engineering-Systems, Tel-Aviv University, Tel-Aviv 69978, Israel
- Cited by 3 (0 self) – Add To MetaCart

