Approximation and online algorithms : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised selected papers / Jochen Koenemann, Britta Peis (eds.).
WAOA (Workshop) (19th : 2021 : Online); Koenemann, Jochen, editor.; Peis, Britta, editor.
2021
QA76.9.A43 W36 2021eb
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 : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised selected papers / Jochen Koenemann, Britta Peis (eds.).
Meeting Name WAOA (Workshop) (19th : 2021 : Online)
ISBN 9783030927028 (electronic bk.)
3030927024 (electronic bk.)
9783030927011 (print)
DOI https://doi.org/10.1007/978-3-030-92702-8
Published Cham, Switzerland : Springer, 2021.
Language English
Description 1 online resource (xii, 275 pages) : illustrations (some color).
Item Number 10.1007/978-3-030-92702-8 doi
Call Number QA76.9.A43 W36 2021eb
Dewey Decimal Classification 005.1
Summary This book constitutes the thoroughly refereed workshop post-proceedings of the 19th International Workshop on Approximation and Online Algorithms, WAOA 2021, held in September 2021. Due to COVID-19 pandemic the conference was held virtually. The 16 revised full papers presented in this book were carefully reviewed and selected from 31 submissions. The papers focus on the design and analysis of algorithms for online and computationally hard problems.
Note "WAOA 2021 took place virtually in Lisbon, Portugal"-- Preface.
Includes 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 3, 2022).
Added Author Koenemann, Jochen, editor.
Peis, Britta, editor.
Series Lecture notes in computer science ; 12982.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Available in Other Form Print version: 9783030927011
Print version: 9783030927035
Linked Resources Online Access
Record Appears in Online Resources > Ebooks
All Resources
How to Navigate Through Obstacles
Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set
An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity
Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs
On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem
The Traveling k-Median Problem: Approximating Optimal Network Coverage
EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource
Several methods of analysis for cardinality constrained bin packing
Leah Epstein Weighted completion time minimization for capacitated parallel machines
Server Cloud Scheduling
FIFO and Randomized Competitive Packet Routing Games
Improved Online Algorithm for Fractional Knapsack in the Random Order Model
Improved Online Algorithm for Fractional Knapsack in the Random Order Model
Improved Analysis of Online Balanced Clustering
Precedence-Constrained Covering Problems with Multiplicity Constraints
Contention Resolution, Matrix Scaling and Fair Allocation.

Browse Subjects

Show more subjects...

Statistics

from
to
Export