國立虎尾科技大學 |

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

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Approximation and Online Algorithms/ edited by Leah Epstein, Thomas Erlebach.
Reminder of title:	16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers /
other author:	Epstein, Leah.
Description:	X, 349 p. 39 illus., 22 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-030-04693-4
ISBN:	9783030046934

Approximation and Online Algorithms = 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers /
Approximation and Online Algorithms16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers /[electronic resource] :edited by Leah Epstein, Thomas Erlebach. - 1st ed. 2018. - X, 349 p. 39 illus., 22 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11312. - Theoretical Computer Science and General Issues ;9163.

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.

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.

ISBN: 9783030046934

Standard No.: 10.1007/978-3-030-04693-4doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Approximation and Online Algorithms = 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers /
LDR:03534nam a22004095i 4500 001 990179
003 DE-He213
005 20200705065134.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783030046934 $9 978-3-030-04693-4
024 7 $a 10.1007/978-3-030-04693-4 $2 doi
035 $a 978-3-030-04693-4
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Approximation and Online Algorithms $h [electronic resource] : $b 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers / $c edited by Leah Epstein, Thomas Erlebach.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a X, 349 p. 39 illus., 22 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 11312
505 0 $a 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.
520 $a 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.
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Numerical analysis. $3 527939
650 0 $a Computer organization. $3 596298
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Numeric Computing. $3 669943
650 2 4 $a Computer Systems Organization and Communication Networks. $3 669309
700 1 $a Epstein, Leah. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 883617
700 1 $a Erlebach, Thomas. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 674714
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030046927
776 0 8 $i Printed edition: $z 9783030046941
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-04693-4
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)