Approximation and Online Algorithms 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Epstein, Leah (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Erlebach, Thomas (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2018.
• Έκδοση: 1st ed. 2018.
• Σειρά: Theoretical Computer Science and General Issues ; 11312
• Θέματα: Algorithms.; Computer science-Mathematics.; Data structures (Computer science).; Numerical analysis.; Computer organization.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Data Structures.; Numeric Computing.; Computer Systems Organization and Communication Networks.

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 b...

Πίνακας περιεχομένων:

• 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
• Reconfiguration of Graphs with Connectivity Constraints
• The Itinerant List Update Problem
• The Price of Fixed Assignments in Stochastic Extensible Bin Packing.