Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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/conf/waoa/AgeevK06.bib},
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 = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/AggarwalFM06.bib},
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 = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/AmzallagNR06.bib},
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 = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Bar-NoyGZ06.bib},
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 = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BergCH06.bib},
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 = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BodlaenderFGPSW06.bib},
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 = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BonifaciS06.bib},
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 = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BoyarEL06.bib},
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 = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/CardinalLL06.bib},
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 = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ChanZ06.bib},
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 = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/DasK06.bib},
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 = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Epstein06.bib},
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 = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/EpsteinL06.bib},
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 = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/FukunagaN06.bib},
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 = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/FurerK06.bib},
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 = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/GalbiatiM06.bib},
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 = {Wed, 19 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/GutinGH06.bib},
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 = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/HanYZ06.bib},
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 = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/HarksHP06.bib},
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 = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/HochbaumL06.bib},
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 = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/KnocheK06.bib},
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 = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/KolmanW06.bib},
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 = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Levin06.bib},
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 = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/MantheyR06.bib},
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/conf/waoa/NikoletseasRS06.bib},
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 = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Taylor06.bib},
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/conf/waoa/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-28 10:27 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
