Cantitate/Preț
Produs
Total produse
Vezi coșul
Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers de Roberto Solis-Oba

Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers: Lecture Notes in Computer Science, cartea 7164

Editat de Roberto Solis-Oba, Giuseppe Persiano
en Limba Engleză Paperback – 30 mar 2012
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 applicationsin 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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 32149 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 23 feb 2005 32149 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 30 mar 2012 40252 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 40252 lei

Preț vechi: 50315 lei
-20% Nou

Puncte Express: 604
Preț estimativ în valută:
7703€ • 8126$ • 6438£

Carte tipărită la comandă

Livrare economică 31 decembrie 24 - 14 ianuarie 25

 Adaugă în coș

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

Specificații

ISBN-13: 9783642291159
ISBN-10: 3642291155
Pagini: 300
Ilustrații: X, 278 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.43 kg
Ediția:2012
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ă

Research

Textul de pe ultima copertă

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.

Caracteristici

Up-to-date results Fast-track conference proceedings State-of-the-art research

Cuprins

Invited Talks.- Online Packet Switching.- Approximation Algorithms for Mixed Fractional Packing and Covering Problems.- Regular Papers.- Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees.- Online Bin Packing with Resource Augmentation.- A PTAS for Delay Minimization in Establishing Wireless Conference Calls.- This Side Up!.- Approximation Algorithm for Directed Multicuts.- Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria.- Approximation Algorithms for Spreading Points.- More Powerful and Simpler Cost-Sharing Methods.- Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints.- Priority Algorithms for Graph Optimization Problems.- Pricing Network Edges to Cross a River.- Submodular Integer Cover and Its Application to Production Planning.- Stochastic Online Scheduling on Parallel Machines.- A -Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path.- Order-Preserving Transformations and Greedy-Like Algorithms.- Off-line Admission Control for Advance Reservations in Star Networks.- Joint Base Station Scheduling.- Universal Bufferless Routing.- Strong Colorings of Hypergraphs.- Deterministic Monotone Algorithms for Scheduling on Related Machines.- Better Bounds for Minimizing SONET ADMs.