國立虎尾科技大學 |

Approximation and Online Algorithms = 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Approximation and Online Algorithms/ edited by Evripidis Bampis, Nicole Megow.
其他題名:	17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers /
其他作者:	Bampis, Evripidis.
面頁冊數:	XII, 253 p. 44 illus., 25 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer mathematics. -
電子資源:	https://doi.org/10.1007/978-3-030-39479-0
ISBN:	9783030394790

Approximation and Online Algorithms = 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers /
Approximation and Online Algorithms17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers /[electronic resource] :edited by Evripidis Bampis, Nicole Megow. - 1st ed. 2020. - XII, 253 p. 44 illus., 25 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11926. - Theoretical Computer Science and General Issues ;9163.

Graph Algorithms -- Inapproximability Results -- Network Design -- Design and Analysis of Approximation and Online Algorithms -- Parameterized Complexity -- Algorithmic Game Theory -- Algorithmic trading -- Competitive analysis -- Computational Advertising -- Computational finance -- Geometric problems -- Mechanism Design. .

This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019. The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 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; and real-world applications.

ISBN: 9783030394790

Standard No.: 10.1007/978-3-030-39479-0doiSubjects--Topical Terms:

1199796
Computer mathematics.

LC Class. No.: QA71-90

Dewey Class. No.: 518

Approximation and Online Algorithms = 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers /
LDR:02717nam a22004095i 4500 001 1021596
003 DE-He213
005 20200630002611.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030394790 $9 978-3-030-39479-0
024 7 $a 10.1007/978-3-030-39479-0 $2 doi
035 $a 978-3-030-39479-0
050 4 $a QA71-90
072 7 $a PBKS $2 bicssc
072 7 $a MAT006000 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 518 $2 23
245 1 0 $a Approximation and Online Algorithms $h [electronic resource] : $b 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers / $c edited by Evripidis Bampis, Nicole Megow.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XII, 253 p. 44 illus., 25 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 11926
505 0 $a Graph Algorithms -- Inapproximability Results -- Network Design -- Design and Analysis of Approximation and Online Algorithms -- Parameterized Complexity -- Algorithmic Game Theory -- Algorithmic trading -- Competitive analysis -- Computational Advertising -- Computational finance -- Geometric problems -- Mechanism Design. .
520 $a This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019. The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 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; and real-world applications.
650 0 $a Computer mathematics. $3 1199796
650 0 $a Computer organization. $3 596298
650 0 $a Application software. $3 528147
650 0 $a Computers. $3 565115
650 0 $a Computer science—Mathematics. $3 1253519
650 1 4 $a Computational Mathematics and Numerical Analysis. $3 669338
650 2 4 $a Computer Systems Organization and Communication Networks. $3 669309
650 2 4 $a Information Systems Applications (incl. Internet). $3 881699
650 2 4 $a Theory of Computation. $3 669322
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Symbolic and Algebraic Manipulation. $3 669944
700 1 $a Bampis, Evripidis. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 896851
700 1 $a Megow, Nicole. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1317259
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030394783
776 0 8 $i Printed edition: $z 9783030394806
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-39479-0
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
912 $a ZDB-2-LNC
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)