bokomslag Approximation and Online Algorithms
Data & IT

Approximation and Online Algorithms

Klaus Jansen Roberto Solis-Oba

Pocket

769:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 10-16 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

Andra format:

  • 273 sidor
  • 2011
This book constitutes the thoroughly refereed post workshop proceedings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event. The 23 revised full papers presented were carefully reviewed and selected from 58 submissions. The workshop covered areas such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, echanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques, real-world applications, and scheduling problems.
  • Författare: Klaus Jansen, Roberto Solis-Oba
  • Format: Pocket/Paperback
  • ISBN: 9783642183171
  • Språk: Engelska
  • Antal sidor: 273
  • Utgivningsdatum: 2011-01-25
  • Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K