Cantitate/Preț
Produs
Total produse
Vezi coșul
Approximation and Online Algorithms: 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers de Klaus Jansen

Approximation and Online Algorithms: 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers: Lecture Notes in Computer Science, cartea 6534

Editat de Klaus Jansen, Roberto Solis-Oba
en Limba Engleză Paperback – 25 ian 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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 32506 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 25 ian 2011 32620 lei  3-5 săpt.
  Springer Berlin, Heidelberg – 12 feb 2004 32506 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 32620 lei

Preț vechi: 40776 lei
-20% Nou

Puncte Express: 489
Preț estimativ în valută:
6243€ • 6485$ • 5186£

Carte disponibilă

Livrare economică 11-25 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642183171
ISBN-10: 3642183174
Pagini: 288
Ilustrații: X, 273 p. 18 illus., 3 illus. in color.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.43 kg
Ediția:2011
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Professional/practitioner

Textul de pe ultima copertă

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, mechanism 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.

Caracteristici

High quality selected papers Unique visibility State of the art research

Cuprins

Contributed Talks.- Online Coloring of Intervals with Bandwidth.- Open Block Scheduling in Optical Communication Networks.- Randomized Priority Algorithms.- Tradeoffs in Worst-Case Equilibria.- Load Balancing of Temporary Tasks in the ? p Norm.- Simple On-Line Algorithms for Call Control in Cellular Networks.- Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees.- A -Approximation Algorithm for Scheduling Identical Malleable Tasks.- Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.- Scheduling AND/OR-Networks on Identical Parallel Machines.- Combinatorial Interpretations of Dual Fitting and Primal Fitting.- On the Approximability of the Minimum Fundamental Cycle Basis Problem.- The Pledge Algorithm Reconsidered under Errors in Sensors and Motion.- The Online Matching Problem on a Line.- How to Whack Moles.- Online Deadline Scheduling: Team Adversary and Restart.- Minimum Sum Multicoloring on the Edges of Trees.- Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms.- On-Line Extensible Bin Packing with Unequal Bin Sizes.- ARACNE Talks.- Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.- Power Consumption Problems in Ad-Hoc Wireless Networks.- A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem.- Disk Graphs: A Short Survey.- Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems.