Search dblp for Publications

export results for "toc:db/conf/waoa/waoa2006.bht:"

 download as .bib file

@inproceedings{DBLP:conf/waoa/AgeevK06,
  author    = {Alexander A. Ageev and
               Alexander V. Kononov},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Approximation Algorithms for Scheduling Problems with Exact Delays},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {1--14},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_1},
  doi       = {10.1007/11970125\_1},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/AgeevK06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/AggarwalFM06,
  author    = {Gagan Aggarwal and
               Jon Feldman and
               S. Muthukrishnan},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Bidding to the Top: {VCG} and Equilibria of Position-Based Auctions},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {15--28},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_2},
  doi       = {10.1007/11970125\_2},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/AggarwalFM06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/AmzallagNR06,
  author    = {David Amzallag and
               Joseph Naor and
               Danny Raz},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Coping with Interference: From Maximum Coverage to Planning Cellular
               Networks},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {29--42},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_3},
  doi       = {10.1007/11970125\_3},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/AmzallagNR06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Bar-NoyGZ06,
  author    = {Amotz Bar{-}Noy and
               Mordecai J. Golin and
               Yan Zhang},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Online Dynamic Programming Speedups},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {43--54},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_4},
  doi       = {10.1007/11970125\_4},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/Bar-NoyGZ06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BergCH06,
  author    = {Mark de Berg and
               Sergio Cabello and
               Sariel Har{-}Peled},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Covering Many or Few Points with Unit Disks},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {55--68},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_5},
  doi       = {10.1007/11970125\_5},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/BergCH06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BodlaenderFGPSW06,
  author    = {Hans L. Bodlaender and
               Corinne Feremans and
               Alexander Grigoriev and
               Eelko Penninkx and
               Ren{\'{e}} Sitters and
               Thomas Wolle},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {On the Minimum Corridor Connection Problem and Other Generalized Geometric
               Problems},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {69--82},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_6},
  doi       = {10.1007/11970125\_6},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/BodlaenderFGPSW06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BonifaciS06,
  author    = {Vincenzo Bonifaci and
               Leen Stougie},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Online \emph{k}-Server Routing Problems},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {83--94},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_7},
  doi       = {10.1007/11970125\_7},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/BonifaciS06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BoyarEL06,
  author    = {Joan Boyar and
               Martin R. Ehmsen and
               Kim S. Larsen},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Theoretical Evidence for the Superiority of {LRU-2} over {LRU} for
               the Paging Problem},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {95--107},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_8},
  doi       = {10.1007/11970125\_8},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/BoyarEL06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/CardinalLL06,
  author    = {Jean Cardinal and
               Stefan Langerman and
               Eythan Levy},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Improved Approximation Bounds for Edge Dominating Set in Dense Graphs},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {108--120},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_9},
  doi       = {10.1007/11970125\_9},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/CardinalLL06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ChanZ06,
  author    = {Timothy M. Chan and
               Hamid Zarrabi{-}Zadeh},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {A Randomized Algorithm for Online Unit Clustering},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {121--131},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_10},
  doi       = {10.1007/11970125\_10},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/ChanZ06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DasK06,
  author    = {Aparna Das and
               Claire Kenyon},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {On Hierarchical Diameter-Clustering, and the Supplier Problem},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {132--145},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_11},
  doi       = {10.1007/11970125\_11},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/DasK06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Epstein06,
  author    = {Leah Epstein},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Bin Packing with Rejection Revisited},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {146--159},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_12},
  doi       = {10.1007/11970125\_12},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/Epstein06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/EpsteinL06,
  author    = {Leah Epstein and
               Asaf Levin},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {On Bin Packing with Conflicts},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {160--173},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_13},
  doi       = {10.1007/11970125\_13},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/EpsteinL06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/FukunagaN06,
  author    = {Takuro Fukunaga and
               Hiroshi Nagamochi},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Network Design with Edge-Connectivity and Degree Constraints},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {188--201},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_15},
  doi       = {10.1007/11970125\_15},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/FukunagaN06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/FurerK06,
  author    = {Martin F{\"{u}}rer and
               Shiva Prasad Kasiviswanathan},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Approximate Distance Queries in Disk Graphs},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {174--187},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_14},
  doi       = {10.1007/11970125\_14},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/FurerK06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/GalbiatiM06,
  author    = {Giulia Galbiati and
               Francesco Maffioli},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Approximating Maximum Cut with Limited Unbalance},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {202--213},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_16},
  doi       = {10.1007/11970125\_16},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/GalbiatiM06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/GutinGH06,
  author    = {Gregory Z. Gutin and
               Boris Goldengorin and
               Jing Huang},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for
               Multidimensional Assignment and Traveling Salesman Problems},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {214--225},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_17},
  doi       = {10.1007/11970125\_17},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/GutinGH06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HanYZ06,
  author    = {Xin Han and
               Deshi Ye and
               Yong Zhou},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Improved Online Hypercube Packing},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {226--239},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_18},
  doi       = {10.1007/11970125\_18},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/HanYZ06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HarksHP06,
  author    = {Tobias Harks and
               Stefan Heinz and
               Marc E. Pfetsch},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Competitive Online Multicommodity Routing},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {240--252},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_19},
  doi       = {10.1007/11970125\_19},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/HarksHP06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HochbaumL06,
  author    = {Dorit S. Hochbaum and
               Asaf Levin},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {The \emph{k}-Allocation Problem and Its Variants},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {253--264},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_20},
  doi       = {10.1007/11970125\_20},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/HochbaumL06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/KnocheK06,
  author    = {J{\"{o}}rg Knoche and
               Piotr Krysta},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {An Experimental Study of the Misdirection Algorithm for Combinatorial
               Auctions},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {265--278},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_21},
  doi       = {10.1007/11970125\_21},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/KnocheK06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/KolmanW06,
  author    = {Petr Kolman and
               Tomasz Walen},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Reversal Distance for Strings with Duplicates: Linear Time Approximation
               Using Hitting Set},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {279--289},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_22},
  doi       = {10.1007/11970125\_22},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/KolmanW06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Levin06,
  author    = {Asaf Levin},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Approximating the Unweighted \emph{k}-Set Cover Problem: Greedy Meets
               Local Search},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {290--301},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_23},
  doi       = {10.1007/11970125\_23},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/Levin06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/MantheyR06,
  author    = {Bodo Manthey and
               L. Shankar Ram},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Approximation Algorithms for Multi-criteria Traveling Salesman Problems},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {302--315},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_24},
  doi       = {10.1007/11970125\_24},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/MantheyR06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/NikoletseasRS06,
  author    = {Sotiris E. Nikoletseas and
               Christoforos L. Raptopoulos and
               Paul G. Spirakis},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {The Survival of the Weakest in Networks},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {316--329},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_25},
  doi       = {10.1007/11970125\_25},
  timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/NikoletseasRS06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Taylor06,
  author    = {David Scot Taylor},
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Online Distributed Object Migration},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  pages     = {330--344},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125\_26},
  doi       = {10.1007/11970125\_26},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/Taylor06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2006,
  editor    = {Thomas Erlebach and
               Christos Kaklamanis},
  title     = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
               2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4368},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11970125},
  doi       = {10.1007/11970125},
  isbn      = {3-540-69513-3},
  timestamp = {Tue, 14 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics