Epstein / Erlebach Approximation and Online Algorithms

16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers
Erscheinungsjahr 2018
ISBN: 978-3-030-04693-4
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 11312, 349 Seiten, eBook

Reihe: Lecture Notes in Computer Science

This book constitutes the thoroughly refereed workshop post-proceedings of the 16th International Workshop on Approximation and Online Algorithms, WAOA 2018, held in Helsinki, Finland, in August 2018 as part of ALGO 2018. The 19 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 44 submissions. Topics of interest for WAOA 2016 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.

Zielgruppe

Research

Autoren/Hrsg.

Epstein, Leah

Erlebach, Thomas

Inhaltsverzeichnis

Some Easy and Some Not So Easy Geometric Optimization Problems.- Deterministic Min-Cost Matching with Delays.- Sequential Metric Dimension.- A Primal-Dual Online Deterministic Algorithm for Matching with Delays.- Advice Complexity of Priority Algorithms.- Approximating Node-Weighted k-MST on Planar Graphs.- Exploring Sparse Graphs with Advice.- Call Admission Problems on Grids with Advice.- Improved Approximation Algorithms for Minimum Power Covering Problems.- DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.- Strategic Contention Resolution in Multiple Channels.- Sublinear Graph Augmentation for Fast Query Implementation.- Bin Packing Games with Weight Decision: How To Get a Small Value for the Price of Anarchy.- Probabilistic Embeddings of the Fréchet Distance.- Algorithms for Dynamic NFV Workload.- Longest Increasing Subsequence under Persistent Comparison Errors.- Cut Sparsifiers for Balanced Digraphs.- Reconfigurationof Graphs with Connectivity Constraints.- The Itinerant List Update Problem.- The Price of Fixed Assignments in Stochastic Extensible Bin Packing.