Search the dblp DataBase

Publications of Author

1. Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
   Bi-criteria linear-time approximations for generalized k-mean/median/center. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 2007, pp:19-26 [Conf]
   
2. Jochen Könemann, Ojas Parekh, Danny Segev
   A Unified Approach to Approximating Partial Covering Problems. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:468-479 [Conf]
   
3. Ojas Parekh, Danny Segev
   Path Hitting in Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:564-575 [Conf]
   
4. Danny Segev, Gil Segev
   Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:600-611 [Conf]
   
5. Refael Hassin, Danny Segev
   The Set Cover with Pairs Problem. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2005, pp:164-176 [Conf]
   
6. Refael Hassin, Jérôme Monnot, Danny Segev
   Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. [Citation Graph (0, 0)][DBLP]
   MFCS, 2006, pp:480-491 [Conf]
   
7. Iftah Gamzu, Danny Segev
   Improved Online Algorithms for the Sorting Buffer Problem. [Citation Graph (0, 0)][DBLP]
   STACS, 2007, pp:658-669 [Conf]
   
8. Refael Hassin, Danny Segev
   Robust Subgraphs for Trees and Paths. [Citation Graph (0, 0)][DBLP]
   SWAT, 2004, pp:51-63 [Conf]
   
9. Refael Hassin, Danny Segev
   The Multi-radius Cover Problem. [Citation Graph (0, 0)][DBLP]
   WADS, 2005, pp:24-35 [Conf]
   
10. Asaf Levin, Danny Segev
    Partial Multicuts in Trees. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:320-333 [Conf]
    
11. Refael Hassin, Danny Segev
    Rounding to an Integral Program. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:44-54 [Conf]
    
12. Refael Hassin, Danny Segev
    Robust subgraphs for trees and paths. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:2, pp:263-281 [Journal]
    
13. Asaf Levin, Danny Segev
    Partial multicuts in trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:384-395 [Journal]
    
14. 
    Scheduling with Outliers. [Citation Graph (, )][DBLP]
    
    
15. 
    A Sublogarithmic Approximation for Highway and Tollbooth Pricing. [Citation Graph (, )][DBLP]
    
    
16. 
    Set connectivity problems in undirected graphs and the directed Steiner network problem. [Citation Graph (, )][DBLP]
    
    
17. 
    Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. [Citation Graph (, )][DBLP]
    
    
18. 
    Improved Orientations of Physical Networks. [Citation Graph (, )][DBLP]
    
    
19. 
    The Complexity of Bottleneck Labeled Graph Problems. [Citation Graph (, )][DBLP]
    
    
20. 
    Path Hitting in Acyclic Graphs. [Citation Graph (, )][DBLP]
    
    
21. 
    Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. [Citation Graph (, )][DBLP]
    
    
22. 
    Scheduling with Outliers [Citation Graph (, )][DBLP]
    
    
23. 
    Improved approximation guarantees for weighted matching in the semi-streaming model [Citation Graph (, )][DBLP]
    
    
24. 
    A Sublogarithmic Approximation for Highway and Tollbooth Pricing [Citation Graph (, )][DBLP]