Conferences in DBLP

Workshop on Approximation and Online Algorithms (waoa)
2006 (conf/waoa/2006)

1. Alexander A. Ageev, Alexander V. Kononov
   Approximation Algorithms for Scheduling Problems with Exact Delays. [Citation Graph (0, 0)][DBLP]
   WAOA, 2006, pp:1-14 [Conf]
   
2. Gagan Aggarwal, Jon Feldman, S. Muthukrishnan
   Bidding to the Top: VCG and Equilibria of Position-Based Auctions. [Citation Graph (0, 0)][DBLP]
   WAOA, 2006, pp:15-28 [Conf]
   
3. David Amzallag, Joseph Naor, Danny Raz
   Coping with Interference: From Maximum Coverage to Planning Cellular Networks. [Citation Graph (0, 0)][DBLP]
   WAOA, 2006, pp:29-42 [Conf]
   
4. Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang
   Online Dynamic Programming Speedups. [Citation Graph (0, 0)][DBLP]
   WAOA, 2006, pp:43-54 [Conf]
   
5. Mark de Berg, Sergio Cabello, Sariel Har-Peled
   Covering Many or Few Points with Unit Disks. [Citation Graph (0, 0)][DBLP]
   WAOA, 2006, pp:55-68 [Conf]
   
6. Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle
   On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems. [Citation Graph (0, 0)][DBLP]
   WAOA, 2006, pp:69-82 [Conf]
   
7. Vincenzo Bonifaci, Leen Stougie
   Online k-Server Routing Problems. [Citation Graph (0, 0)][DBLP]
   WAOA, 2006, pp:83-94 [Conf]
   
8. Joan Boyar, Martin R. Ehmsen, Kim S. Larsen
   Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem. [Citation Graph (0, 0)][DBLP]
   WAOA, 2006, pp:95-107 [Conf]
   
9. Jean Cardinal, Stefan Langerman, Eythan Levy
   Improved Approximation Bounds for Edge Dominating Set in Dense Graphs. [Citation Graph (0, 0)][DBLP]
   WAOA, 2006, pp:108-120 [Conf]
   
10. Timothy M. Chan, Hamid Zarrabi-Zadeh
    A Randomized Algorithm for Online Unit Clustering. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:121-131 [Conf]
    
11. Aparna Das, Claire Kenyon
    On Hierarchical Diameter-Clustering, and the Supplier Problem. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:132-145 [Conf]
    
12. Leah Epstein
    Bin Packing with Rejection Revisited. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:146-159 [Conf]
    
13. Leah Epstein, Asaf Levin
    On Bin Packing with Conflicts. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:160-173 [Conf]
    
14. Martin Fürer, Shiva Prasad Kasiviswanathan
    Approximate Distance Queries in Disk Graphs. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:174-187 [Conf]
    
15. Takuro Fukunaga, Hiroshi Nagamochi
    Network Design with Edge-Connectivity and Degree Constraints. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:188-201 [Conf]
    
16. Giulia Galbiati, Francesco Maffioli
    Approximating Maximum Cut with Limited Unbalance. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:202-213 [Conf]
    
17. Gregory Gutin, Boris Goldengorin, Jing Huang
    Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:214-225 [Conf]
    
18. Xin Han, Deshi Ye, Yong Zhou
    Improved Online Hypercube Packing. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:226-239 [Conf]
    
19. Tobias Harks, Stefan Heinz, Marc E. Pfetsch
    Competitive Online Multicommodity Routing. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:240-252 [Conf]
    
20. Dorit S. Hochbaum, Asaf Levin
    The k-Allocation Problem and Its Variants. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:253-264 [Conf]
    
21. Jörg Knoche, Piotr Krysta
    An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:265-278 [Conf]
    
22. Petr Kolman, Tomasz Walen
    Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:279-289 [Conf]
    
23. Asaf Levin
    Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:290-301 [Conf]
    
24. Bodo Manthey, L. Shankar Ram
    Approximation Algorithms for Multi-criteria Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:302-315 [Conf]
    
25. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis
    The Survival of the Weakest in Networks. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:316-329 [Conf]
    
26. David Scot Taylor
    Online Distributed Object Migration. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:330-344 [Conf]