Approximation and Online Algorithms (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
273
Utgivningsdatum
2015-04-23
Upplaga
2015 ed.
Förlag
Springer International Publishing AG
Medarbetare
Bampis, Evripidis (ed.), Svensson, Ola (ed.)
Illustratör/Fotograf
Bibliographie 29 schwarz-weiße Abbildungen
Illustrationer
29 Illustrations, black and white; X, 273 p. 29 illus.
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9783319182629
Approximation and Online Algorithms (häftad)

Approximation and Online Algorithms

12th International Workshop, WAOA 2014, Wroclaw, Poland, September 11-12, 2014, Revised Selected Papers

Häftad Engelska, 2015-04-23
579
Skickas inom 5-8 vardagar.
Fri frakt inom Sverige för privatpersoner.
Finns även som
Visa alla 1 format & utgåvor
This book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wroclaw, Poland, in September 2014 as part of ALGO 2014. The 22 revised full papers presented were carefully reviewed and selected from 49 submissions. They cover a wide range of topics such as coloring and partitioning, competitive analysis, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.
Visa hela texten

Passar bra ihop

  1. Approximation and Online Algorithms
  2. +
  3. Experimental Algorithms

De som köpt den här boken har ofta också köpt Experimental Algorithms av Evripidis Bampis (häftad).

Köp båda 2 för 1448 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Bloggat om Approximation and Online Algorithms

Innehållsförteckning

Improved Approximations for the Max k-Colored Clustering Problem.- A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line.- Better Algorithms for Online Bin Stretching.- Online Colored Bin Packing.- Improved Bound for Online Square-into-Square Packing.- Improved Approximation Algorithm for Fault-Tolerant Facility Placement.- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem.- Online Multi-Coloring with Advice.- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points.- Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling.- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage.- Linear-Time Approximation Algorithms for Unit Disk Graphs.- The Minimum Feasible Tileset Problem.- Online Ad Assignment with an Ad Exchange.- Minimum Linear Arrangement of Series-Parallel Graphs.- Online Dual Edge Coloring of Paths and Trees.- Online Packet Scheduling Under Adversarial Jamming.- Generalized Hypergraph Matching via Iterated Packing and Local Ratio.- Steiner Trees with Bounded RC-Delay.- Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms.- Routing Under Uncertainty: The a priori Traveling Repairman Problem.- Primal-Dual Algorithms for Precedence Constrained Covering Problems.