國立虎尾科技大學 |

Approximation and Online Algorithms = 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Approximation and Online Algorithms/ edited by Christos Kaklamanis, Asaf Levin.
Reminder of title:	18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers /
other author:	Kaklamanis, Christos.
Description:	XII, 237 p. 31 illus., 9 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-030-80879-2
ISBN:	9783030808792

Approximation and Online Algorithms = 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers /
Approximation and Online Algorithms18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers /[electronic resource] :edited by Christos Kaklamanis, Asaf Levin. - 1st ed. 2021. - XII, 237 p. 31 illus., 9 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12806. - Theoretical Computer Science and General Issues ;9163.

Design and analysis of algorithms -- Online algorithms, approximation algorithms analysis -- Algorithmic game theory and mechanism design -- Parameterized complexity -- Scheduling algorithms -- Competitive analysis. Packing and covering problems -- Rounding techniques.

This book constitutes the thoroughly refereed workshop post-proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2019, held virtually in September 2020 as part of ALGO 2020. The 15 revised full papers presented this book were carefully reviewed and selected from 40 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, real-world applications. Chapter "Explorable Uncertainty in Scheduling with Non-Uniform Testing Times" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

ISBN: 9783030808792

Standard No.: 10.1007/978-3-030-80879-2doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 518.1

Approximation and Online Algorithms = 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers /
LDR:02782nam a22004095i 4500 001 1046857
003 DE-He213
005 20211201220318.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030808792 $9 978-3-030-80879-2
024 7 $a 10.1007/978-3-030-80879-2 $2 doi
035 $a 978-3-030-80879-2
050 4 $a QA76.9.A43
072 7 $a PBKS $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 518.1 $2 23
245 1 0 $a Approximation and Online Algorithms $h [electronic resource] : $b 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers / $c edited by Christos Kaklamanis, Asaf Levin.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XII, 237 p. 31 illus., 9 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 12806
505 0 $a Design and analysis of algorithms -- Online algorithms, approximation algorithms analysis -- Algorithmic game theory and mechanism design -- Parameterized complexity -- Scheduling algorithms -- Competitive analysis. Packing and covering problems -- Rounding techniques.
520 $a This book constitutes the thoroughly refereed workshop post-proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2019, held virtually in September 2020 as part of ALGO 2020. The 15 revised full papers presented this book were carefully reviewed and selected from 40 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, real-world applications. Chapter "Explorable Uncertainty in Scheduling with Non-Uniform Testing Times" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
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 Computers. $3 565115
650 0 $a Application software. $3 528147
650 2 4 $a Symbolic and Algebraic Manipulation. $3 669944
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Theory of Computation. $3 669322
650 2 4 $a Computer Applications. $3 669785
700 1 $a Kaklamanis, Christos. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 678739
700 1 $a Levin, Asaf. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1350451
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030808785
776 0 8 $i Printed edition: $z 9783030808808
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-80879-2
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)