Del 8952 - Lecture Notes in Computer Science

Approximation and Online Algorithms

12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers

Häftad, Engelska, 2015

659 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2015-05-04
Mått155 x 235 x 16 mm
Vikt435 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor273
FörlagSpringer International Publishing AG
ISBN9783319182629

Tillhör följande kategorier

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.

Du kanske också är intresserad av

Avtalsrätt II

Axel Adlercreutz, Lars Gorton, Ola Svensson

Häftad

499 kr

Juridiska grundbegrepp

Christian Dahlman, Lena Wahlberg, Johan Adestam, Niklas Arvidsson, Leila Brännström, Åke Frändberg, Sverker Jönsson, Lars Lindahl, Ulf Linderfalk, Patricia Mindus, Karol Nowak, Ellika Sevelin, Torben Spaak, Ola Svensson, Sacharias Votinius, Ola Zetterquist