Skip to main content
  • Conference proceedings
  • © 2012

Approximation and Online Algorithms

9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers

  • Up-to-date results

  • Fast-track conference proceedings

  • State-of-the-art research

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 7164)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): WAOA: International Workshop on Approximation and Online Algorithms

Conference proceedings info: WAOA 2011.

Buying options

eBook USD 54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (22 papers)

  1. Front Matter

  2. Learning in Stochastic Machine Scheduling

    • Sebastián Marbán, Cyriel Rutten, Tjark Vredeveld
    Pages 21-34
  3. An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems

    • Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara
    Pages 35-48
  4. Single Approximation for Biobjective Max TSP

    • Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
    Pages 49-62
  5. Parameterized Approximation Algorithms for Hitting Set

    • Ljiljana Brankovic, Henning Fernau
    Pages 63-76
  6. Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs

    • Nadine Schwartges, Joachim Spoerhase, Alexander Wolff
    Pages 77-88
  7. Optimization over Integers with Robustness in Cost and Few Constraints

    • Kai-Simon Goetzmann, Sebastian Stiller, Claudio Telha
    Pages 89-101
  8. Scheduling Jobs on Identical and Uniform Processors Revisited

    • Klaus Jansen, Christina Robenek
    Pages 109-122
  9. Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models

    • Jianqiao Zhu, Ho-Leung Chan, Tak-Wah Lam
    Pages 137-149
  10. A New Perspective on List Update: Probabilistic Locality and Working Set

    • Reza Dorrigiv, Alejandro López-Ortiz
    Pages 150-163
  11. OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm

    • Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu
    Pages 164-175
  12. Simpler 3/4-Approximation Algorithms for MAX SAT

    • Anke van Zuylen
    Pages 188-197
  13. On Online Algorithms with Advice for the k-Server Problem

    • Marc P. Renault, Adi Rosén
    Pages 198-210
  14. Improved Lower Bound for Online Strip Packing

    • Rolf Harren, Walter Kern
    Pages 211-218
  15. Competitive Router Scheduling with Structured Data

    • Yishay Mansour, Boaz Patt-Shamir, Dror Rawitz
    Pages 219-232

Other Volumes

  1. Approximation and Online Algorithms

About this book

This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems.

Keywords

  • approximation algorithms
  • competitive analysis
  • game theory
  • robust optimization
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Department of Computer Science, The University of Western Ontario, London, Canada

    Roberto Solis-Oba

  • Dipartimento di Informatica "Renato M. Capocelli", Università di Salerno, Fisciano, Italy

    Giuseppe Persiano

Bibliographic Information

Buying options

eBook USD 54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions