Approximation and online algorithms : 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised selected papers / Klaus Jansen, Monaldo Mastrolilli (eds.).
WAOA (Workshop) (14th : 2016 : Aarhus, Denmark); Jansen, Klaus, editor.; Mastrolilli, Monaldo, editor.
2017
QA76.9.A43
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 : 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised selected papers / Klaus Jansen, Monaldo Mastrolilli (eds.).
Meeting Name WAOA (Workshop) (14th : 2016 : Aarhus, Denmark)
ISBN 9783319517414 (electronic book)
3319517414 (electronic book)
9783319517407
DOI https://doi.org/10.1007/978-3-319-51741-4
Published Cham, Switzerland : Springer, 2017.
Language English
Description 1 online resource (xvi, 211 pages) : illustrations.
Item Number 10.1007/978-3-319-51741-4 doi
Call Number QA76.9.A43
Dewey Decimal Classification 005.1
Summary This book constitutes the thoroughly refereed post-workshop proceedings of the 14th International Workshop on Approximation and Online Algorithms, WAOA 2016, held in Aarhus, Denmark, in August 2016 as part of ALGO 2016. The 16 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 33 submissions. Topics of interest for WAOA 2016 were: 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.
Bibliography, etc. Note Includes bibliographical references and author index.
Access Note Access limited to authorized users.
Digital File Characteristics text file PDF
Source of Description Online resource; title from PDF title page (SpringerLink, viewed January 19, 2017).
Added Author Jansen, Klaus, editor.
Mastrolilli, Monaldo, editor.
Series Lecture notes in computer science ; 10138.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Available in Other Form Print version: 9783319517407
Linked Resources Online Access
Record Appears in Online Resources > Ebooks
All Resources
Approximation Algorithms for the k-Set Packing Problem
On Linear and Semidefinite Programs for Polytopes in Combinatorial Optimization
The Shortest Separating Cycle Problem
Dynamic Traveling Repair Problem with an Arbitrary Time Window
A PTAS for the Cluster Editing Problem on Planar Graphs
Bin Packing with Colocations
Batch Coloring of Graphs
New Integrality Gap Results for the Firefighters Problem on Trees
A Multiplicative Weights Update Algorithm for Packing and Covering Semi-Infinite Linear Programs
Balanced Optimization with Vector Costs
Vertex Sparsification in Trees
Scenario Submodular Cover
Non-Greedy Online Steiner Trees on Outerplanar Graphs
A Refined Analysis of Online Path Coloring in Trees
Resource Allocation Games with Multiple Resource Classes
Tight Approximation Bounds for the Seminar Assignment Problem
A Priori TSP in the Scenario Model
Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems. .

Browse Subjects

Show more subjects...

Statistics

from
to
Export