LEADER 04616nam 22007575 450 001 9910349389403321 005 20251225202221.0 010 $a9783030046934 010 $a3030046931 024 7 $a10.1007/978-3-030-04693-4 035 $a(CKB)4100000007181096 035 $a(DE-He213)978-3-030-04693-4 035 $a(MiAaPQ)EBC6303340 035 $a(PPN)232471037 035 $a(EXLCZ)994100000007181096 100 $a20181128d2018 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aApproximation and Online Algorithms $e16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers /$fedited by Leah Epstein, Thomas Erlebach 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (X, 349 p. 39 illus., 22 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11312 311 08$a9783030046927 311 08$a3030046923 327 $aSome 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11312 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence$xData processing 606 $aNumerical analysis 606 $aComputer engineering 606 $aComputer networks 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 606 $aNumerical Analysis 606 $aComputer Engineering and Networks 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence$xData processing. 615 0$aNumerical analysis. 615 0$aComputer engineering. 615 0$aComputer networks. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 615 24$aNumerical Analysis. 615 24$aComputer Engineering and Networks. 676 $a005.1 676 $a005.1 702 $aEpstein$b Leah$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aErlebach$b Thomas$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910349389403321 996 $aApproximation and Online Algorithms$92954916 997 $aUNINA