Approximation and Online Algorithms : 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised selected papers / Evripidis Bampis, Nicole Megow (eds.).
Material type:
TextSeries: Serienbezeichnung | Lecture notes in computer science ; 11926. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publisher: Cham, Switzerland : Springer, [2020]Description: 1 online resource (xii, 253 pages) : illustrations (some color)Content type: text Media type: computer Carrier type: online resourceISBN: 9783030394790; 3030394794; 3030394786; 9783030394783; 9783030394806; 3030394808Other title: WAOA 2019Subject(s): Online algorithms -- Congresses | Approximation algorithms -- Congresses | Computer science -- Mathematics | Approximation algorithms | Computer science -- Mathematics | Online algorithmsGenre/Form: Electronic books. | Electronic books. | Conference papers and proceedings. Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.1 | 518 LOC classification: QA76.9.A43 | W36 2019Online resources: Click here to access online | Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
eBook
|
e-Library
Electronic Book@IST |
EBook | Available |
Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains -- A New Lower Bound for Classic Online Bin Packing -- Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts -- Robust Online Algorithms for Certain Dynamic Packing Problems -- Approximation Results for Makespan Minimization with Budgeted Uncertainty -- Streaming Algorithms for Bin Packing and Vector Scheduling -- An Improved Upper Bound for the Ring Loading Problem -- Parallel Online Algorithms for the Bin Packing Problem -- Managing Multiple Mobile Resources -- Hardness and Approximation Algorithms -- Approximate Strong Edge-Colouring of Unit Disk Graphs -- Precedence-Constrained Scheduling and Min-Sum Set Cover (Extended Abstract) -- Fault Tolerant Clustering with Outliers -- Improved (In-)Approximability Bounds for d-Scattered Set -- Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs -- Fair Coresets and Streaming Algorithms for Fair k-means -- Correction to: Approximation and Online Algorithms.
This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019. The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
Includes author index.
Online resource; title from digital title page (viewed on April 09, 2020).