國立虎尾科技大學 |

Approximation and Online Algorithms = 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Approximation and Online Algorithms/ edited by Roberto Solis-Oba, Rudolf Fleischer.
Reminder of title:	15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers /
other author:	Solis-Oba, Roberto.
Description:	X, 329 p. 42 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-319-89441-6
ISBN:	9783319894416

Approximation and Online Algorithms = 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers /
Approximation and Online Algorithms15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers /[electronic resource] :edited by Roberto Solis-Oba, Rudolf Fleischer. - 1st ed. 2018. - X, 329 p. 42 illus.online resource. - Theoretical Computer Science and General Issues ;10787. - Theoretical Computer Science and General Issues ;9163.

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 -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Mechanism design -- Resource augmentation -- Real-world applications.

This book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017. The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 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; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.

ISBN: 9783319894416

Standard No.: 10.1007/978-3-319-89441-6doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Approximation and Online Algorithms = 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers /
LDR:02773nam a22004095i 4500 001 991924
003 DE-He213
005 20200705102303.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783319894416 $9 978-3-319-89441-6
024 7 $a 10.1007/978-3-319-89441-6 $2 doi
035 $a 978-3-319-89441-6
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 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers / $c edited by Roberto Solis-Oba, Rudolf Fleischer.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a X, 329 p. 42 illus. $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 10787
505 0 $a 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 -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Mechanism design -- Resource augmentation -- Real-world applications.
520 $a This book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017. The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 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; 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 Numerical analysis. $3 527939
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer communication systems. $3 1115394
650 0 $a Computer graphics. $3 561602
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 Numeric Computing. $3 669943
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Computer Graphics. $3 669895
700 1 $a Solis-Oba, Roberto. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 674692
700 1 $a Fleischer, Rudolf. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 680940
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319894409
776 0 8 $i Printed edition: $z 9783319894423
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-89441-6
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)