Search the dblp DataBase

Publications of Author

1. Julián Mestre
   A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2005, pp:182-191 [Conf]
   
2. Rajiv Gandhi, Julián Mestre
   Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2006, pp:128-139 [Conf]
   
3. Julián Mestre
   Greedy in Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:528-539 [Conf]
   
4. Julián Mestre
   Weighted Popular Matchings. [Citation Graph (0, 0)][DBLP]
   ICALP (1), 2006, pp:715-726 [Conf]
   
5. Maria-Esther Vidal, Louiqa Raschid, Julián Mestre
   Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan. [Citation Graph (0, 0)][DBLP]
   WebDB, 2004, pp:61-66 [Conf]
   
6. Julián Mestre
   On the multi-radius cover problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:5, pp:195-198 [Journal]
   
7. Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz
   Approximation of Partial Capacitated Vertex Cover. [Citation Graph (0, 0)][DBLP]
   ESA, 2007, pp:335-346 [Conf]
   
8. Samir Khuller, Azarakhsh Malekian, Julián Mestre
   To Fill or Not to Fill: The Gas Station Problem. [Citation Graph (0, 0)][DBLP]
   ESA, 2007, pp:534-545 [Conf]
   
9. Julián Mestre
   Weighted Popular Matchings [Citation Graph (0, 0)][DBLP]
   CoRR, 2007, v:0, n:, pp:- [Journal]
   
10. 
    A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem. [Citation Graph (, )][DBLP]
    
    
11. 
    The Checkpoint Problem. [Citation Graph (, )][DBLP]
    
    
12. 
    An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. [Citation Graph (, )][DBLP]
    
    
13. 
    When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
14. 
    Popular Mixed Matchings. [Citation Graph (, )][DBLP]
    
    
15. 
    Universal Sequencing on a Single Machine. [Citation Graph (, )][DBLP]
    
    
16. 
    Max-Coloring Paths: Tight Bounds and Extensions. [Citation Graph (, )][DBLP]
    
    
17. 
    Adaptive local ratio. [Citation Graph (, )][DBLP]
    
    
18. 
    Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. [Citation Graph (, )][DBLP]
    
    
19. 
    Lagrangian Relaxation and Partial Cover (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
20. 
    Improved Approximations for Guarding 1.5-Dimensional Terrains. [Citation Graph (, )][DBLP]
    
    
21. 
    Approximating the Interval Constrained Coloring Problem. [Citation Graph (, )][DBLP]
    
    
22. 
    Parametric Packing of Selfish Items and the Subset Sum Algorithm. [Citation Graph (, )][DBLP]
    
    
23. 
    Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. [Citation Graph (, )][DBLP]
    
    
24. 
    A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. [Citation Graph (, )][DBLP]
    
    
25. 
    Lagrangian Relaxation and Partial Cover [Citation Graph (, )][DBLP]
    
    
26. 
    Improved Approximations for Guarding 1.5-Dimensional Terrains [Citation Graph (, )][DBLP]
    
    
27. 
    Improved approximation guarantees for weighted matching in the semi-streaming model [Citation Graph (, )][DBLP]
    
    
28. 
    Parametric packing of selfish items and the subset sum algorithm [Citation Graph (, )][DBLP]
    
    
29. 
    Improved bounds for stochastic matching [Citation Graph (, )][DBLP]
    
    
30. 
    When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings [Citation Graph (, )][DBLP]