Cantitate/Preț
Produs
Total produse
Vezi coșul
Approximation and Online Algorithms: First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers de Klaus Jansen

Approximation and Online Algorithms: First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers: Lecture Notes in Computer Science, cartea 2909

Editat de Klaus Jansen, Roberto Solis-Oba
en Limba Engleză Paperback – 12 feb 2004
The Workshop on Approximation and Online Algorithms (WAOA 2003) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications ar- ing from a variety of ?elds. The workshop also covered experimental research on approximation and online algorithms. WAOA 2003 took place in Budapest, Hungary, from September 16 to September 18. The workshop was part of the ALGO 2003 event, which also hosted ESA 2003, WABI 2003, and ATMOS 2003. TopicsofinterestforWAOA2003were:competitiveanalysis,inapproximab- ityresults,randomizationtechniques,approximationclasses,scheduling,coloring and partitioning, cuts and connectivity, packing and covering, geometric pr- lems, network design, and applications to game theory and ?nancial problems. In response to our call for papers we received 41 submissions. Each submission was reviewed by at least 3 referees, who judged the papers on originality, quality, and consistency with the topics of the conference. Based on these reviews the program committee selected 19 papers for presentation at the workshop and for publication in this proceedings. This volume contains the 19 selected papers and 5 invited abstracts from an ARACNE minisymposium which took place as part of WAOA.
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ț: 32506 lei

Preț vechi: 40632 lei
-20% Nou

Puncte Express: 488
Preț estimativ în valută:
6222€ • 6527$ • 5161£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 25

 Adaugă în coș

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

Specificații

ISBN-13: 9783540210795
ISBN-10: 3540210792
Pagini: 284
Ilustrații: VIII, 268 p.
Dimensiuni: 155 x 233 x 15 mm
Greutate: 0.4 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

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.

Caracteristici

Includes supplementary material: sn.pub/extras

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.