The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Zeev Nutov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guy Kortsarz, Zeev Nutov
    Approximating node connectivity problems via set covers. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:194-205 [Conf]
  2. Joseph Cheriyan, Tibor Jordán, Zeev Nutov
    Approximating k-outconnected Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:77-88 [Conf]
  3. Zeev Nutov
    Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:236-247 [Conf]
  4. Yefim Dinitz, Zeev Nutov
    Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:13-24 [Conf]
  5. Guy Kortsarz, Zeev Nutov
    Tight Approximation Algorithm for Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:443-452 [Conf]
  6. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
    Power Optimization for Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:349-361 [Conf]
  7. Zeev Nutov, Raphael Yuster
    Packing Directed Cycles Efficiently. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:310-321 [Conf]
  8. Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov
    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. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:90-101 [Conf]
  9. Zeev Nutov
    Approximating Rooted Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:141-152 [Conf]
  10. Michael Krivelevich, Zeev Nutov, Raphael Yuster
    Approximation algorithms for cycle packing problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:556-561 [Conf]
  11. Zeev Nutov
    Approximating connectivity augmentation problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:176-185 [Conf]
  12. Zeev Nutov
    Approximating Multiroot 3-Outconnected Subgraphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:951-952 [Conf]
  13. Yefim Dinitz, Zeev Nutov
    A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:509-518 [Conf]
  14. Guy Kortsarz, Zeev Nutov
    Approximation algorithm for k-node connected subgraphs via critical graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:138-145 [Conf]
  15. Yana Kortsarts, Guy Kortsarz, Zeev Nutov
    Approximation Algorithm for Directed Multicuts. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:61-67 [Conf]
  16. Joseph Cheriyan, Tibor Jordán, Zeev Nutov
    On Rooted Node-Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:353-375 [Journal]
  17. Guy Kortsarz, Zeev Nutov
    Approximating Node Connectivity Problems via Set Covers. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:37, n:2, pp:75-92 [Journal]
  18. Zeev Nutov
    Approximating Rooted Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:3, pp:213-231 [Journal]
  19. Zeev Nutov, Michal Penn
    on the Integral Dicycle Packings and Covers and the Linear ordering Polytope. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:293-309 [Journal]
  20. Zeev Nutov, Raphael Yuster
    Packing directed cycles efficiently. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:82-91 [Journal]
  21. Vincenzo Auletta, Yefim Dinitz, Zeev Nutov, Domenico Parente
    A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:32, n:1, pp:21-30 [Journal]
  22. Yefim Dinitz, Zeev Nutov
    A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:32, n:1, pp:31-40 [Journal]
  23. Zeev Nutov, Michal Penn
    On Integrality, Stability and Composition of Dicycle Packings and Covers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:2, pp:235-251 [Journal]
  24. Gilad Liberman, Zeev Nutov
    On shredders and vertex connectivity augmentation. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:91-101 [Journal]
  25. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
    Power optimization for connectivity problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:1, pp:195-208 [Journal]
  26. Yana Kortsarts, Guy Kortsarz, Zeev Nutov
    Greedy approximation algorithms for directed multicuts. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:4, pp:214-217 [Journal]
  27. Zeev Nutov
    Approximating multiroot 3-outconnected subgraphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:3, pp:172-179 [Journal]
  28. Zeev Nutov, Israel Beniaminy, Raphael Yuster
    A (1-1/e)-approximation algorithm for the generalized assignment problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:3, pp:283-288 [Journal]
  29. Zeev Nutov, Michal Penn
    Faster approximation algorithms for weighted triconnectivity augmentation problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:5, pp:219-223 [Journal]
  30. Guy Kortsarz, Zeev Nutov
    Approximating k-node Connected Subgraphs via Critical Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:247-257 [Journal]
  31. Israel Beniaminy, Zeev Nutov, Meir Ovadia
    Approximating Interval Scheduling Problems with Bounded Profits. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:487-497 [Conf]
  32. Yuval Lando, Zeev Nutov
    On Minimum Power Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:87-98 [Conf]

  33. Approximating Minimum-Power k-Connectivity. [Citation Graph (, )][DBLP]


  34. Novel Algorithms for the Network Lifetime Problem in Wireless Settings. [Citation Graph (, )][DBLP]


  35. Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks. [Citation Graph (, )][DBLP]


  36. Approximating Directed Weighted-Degree Constrained Networks. [Citation Graph (, )][DBLP]


  37. Inapproximability of Survivable Networks. [Citation Graph (, )][DBLP]


  38. Approximating Maximum Subgraphs without Short Cycles. [Citation Graph (, )][DBLP]


  39. Approximating Some Network Design Problems with Node Costs. [Citation Graph (, )][DBLP]


  40. Approximating Node-Connectivity Augmentation Problems. [Citation Graph (, )][DBLP]


  41. Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows. [Citation Graph (, )][DBLP]


  42. Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions. [Citation Graph (, )][DBLP]


  43. Approximating Fault-Tolerant Group-Steiner Problems. [Citation Graph (, )][DBLP]


  44. Prize-Collecting Steiner Network Problems. [Citation Graph (, )][DBLP]


  45. Approximating Minimum-Power Degree and Connectivity Problems. [Citation Graph (, )][DBLP]


  46. Approximating Steiner Networks with Node Weights. [Citation Graph (, )][DBLP]


  47. Improved approximating algorithms for Directed Steiner Forest. [Citation Graph (, )][DBLP]


  48. An almost O(log k)-approximation for k-connected subgraphs. [Citation Graph (, )][DBLP]


  49. On (t, k)-shredders in k-connected graphs. [Citation Graph (, )][DBLP]


  50. Listing minimal edge-covers of intersecting families with applications to connectivity problems. [Citation Graph (, )][DBLP]


  51. Approximating minimum-power edge-covers and 2, 3-connectivity. [Citation Graph (, )][DBLP]


  52. Covering a laminar family by leaf to leaf links. [Citation Graph (, )][DBLP]


  53. On extremal k-outconnected graphs. [Citation Graph (, )][DBLP]


  54. Improved approximation algorithms for directed Steiner forest. [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002