Cantitate/Preț
Produs
Total produse
Vezi coșul
Approximation and Online Algorithms: 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers de Thomas Erlebach

Approximation and Online Algorithms: 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers: Lecture Notes in Computer Science, cartea 7846

Editat de Thomas Erlebach, Giuseppe Persiano
en Limba Engleză Paperback – 19 apr 2013
This book constitutes the thoroughly refereed post workshop proceedings of the 10th International Workshop on Approximation and Online Algorithms, WAOA 2012, held in Ljubljana, Slovenia, in September 2012 as part of the ALGO 2012 conference event.The 22 revised full papers presented together with invited talk were carefully reviewed and selected from 60 submissions. The workshop covered areas such as geometric problems, online algorithms, scheduling, algorithmic game theory, and approximation algorithms.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 32652 lei  43-57 zile
  Springer Berlin, Heidelberg – 19 apr 2013 32652 lei  43-57 zile
  Springer Berlin, Heidelberg – 13 feb 2006 32893 lei  43-57 zile

Din seria Lecture Notes in Computer Science

Preț: 32652 lei

Preț vechi: 40815 lei
-20% Nou

Puncte Express: 490
Preț estimativ în valută:
6249€ • 6491$ • 5191£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

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

Specificații

ISBN-13: 9783642380150
ISBN-10: 3642380158
Pagini: 312
Ilustrații: XII, 299 p. 39 illus.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.44 kg
Ediția:2013
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

Cuprins

Invited Contribution.- The Primal-Dual Approach for Online Algorithms.- Session 1: Graphs and Networks.- Independent Set with Advice: The Impact of Graph Knowledge.- Online Multi-Commodity Flow with High Demands.- Approximating Spanning Trees with Few Branches .- On the Complexity of the Regenerator Location Problem – Treewidth and Other Parameters.- Session 2: Geometric Problems.- Online Exploration of Polygons with Holes.- Probabilistic k-Median Clustering in Data Streams.- Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs.- On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods.- Session 3: Online Algorithms.- Asymptotically Optimal Online Page Migration on Three Points.- R–LINE: A Better Randomized 2-Server Algorithm on the Line.- Black and White Bin Packing.- Minimizing Cache Usage in Paging.- Session 4: Scheduling.Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems.- Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling.- Approximating the Throughput by Coolest First Scheduling.- Algorithms for Cost-Aware Scheduling.- Session 5: Algorithmic Game Theory.- A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games.- Some Anomalies of Farsighted Strategic Behavior.- Session 6: Approximation Algorithms Scheduling with an Orthogonal Resource Constraint.- Improved Approximation Guarantees for Lower-Bounded Facility Location.- A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs.- Approximation Algorithms for the Wafer to Wafer Integration Problem.

Textul de pe ultima copertă

This book constitutes the thoroughly refereed post workshop proceedings of the 10th International Workshop on Approximation and Online Algorithms, WAOA 2012, held in Ljubljana, Slovenia, in September 2012 as part of the ALGO 2012 conference event.
The 22 revised full papers presented together with invited talk were carefully reviewed and selected from 60 submissions. The workshop covered areas such as geometric problems, online algorithms, scheduling, algorithmic game theory, and approximation algorithms.

Caracteristici

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