Approximation and online algorithms [electronic resource] : 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised selected papers / Evripidis Bampis, Ola Svensson (eds.).
WAOA (Workshop) (12th : 2014 : Wrocław, Poland); Bampis, Evripidis, editor.; Svensson, Ola, editor.
2015
QA76.9.A43 W36 2015eb
Available Online

Linked e-resources

Linked Resource Online Access
Concurrent users Unlimited
Authorized users Authorized users
Document Delivery Supplied Can lend chapters, not whole ebooks

Details

Title Approximation and online algorithms [electronic resource] : 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised selected papers / Evripidis Bampis, Ola Svensson (eds.).
Meeting Name WAOA (Workshop) (12th : 2014 : Wrocław, Poland)
ISBN 9783319182636 electronic book
3319182633 electronic book
9783319182629
DOI https://doi.org/10.1007/978-3-319-18263-6
Published Cham : Springer, 2015.
Language English
Description 1 online resource (x, 273 pages) : illustrations.
Item Number 10.1007/978-3-319-18263-6 doi
Call Number QA76.9.A43 W36 2015eb
Dewey Decimal Classification 005.1
Summary This book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wrocław, 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.
Note Includes author index.
Access Note Access limited to authorized users.
Source of Description Online resource; title from PDF title page (SpringerLink, viewed May 5, 2015).
Added Author Bampis, Evripidis, editor.
Svensson, Ola, editor.
Series Lecture notes in computer science ; 8952.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Linked Resources Online Access
Record Appears in Online Resources > Ebooks
All Resources
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.

Browse Subjects

Show more subjects...

Statistics

from
to
Export