國立虎尾科技大學 |

Approximation and Online Algorithms = 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Approximation and Online Algorithms/ edited by Laura Sanità, Martin Skutella.
其他題名:	13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers /
其他作者:	Sanità, Laura.
面頁冊數:	X, 209 p. 24 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-319-28684-6
ISBN:	9783319286846

Approximation and Online Algorithms = 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers /
Approximation and Online Algorithms13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers /[electronic resource] :edited by Laura Sanità, Martin Skutella. - 1st ed. 2015. - X, 209 p. 24 illus. in color.online resource. - Theoretical Computer Science and General Issues ;9499. - Theoretical Computer Science and General Issues ;9163.

Algorithmic game theory -- Algorithmic trading -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Graph algorithms -- Inapproximability -- Mechanism design -- Natural algorithms -- Network design -- Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications.

This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015. The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems,and real-world applications.

ISBN: 9783319286846

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

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Approximation and Online Algorithms = 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers /
LDR:02776nam a22004095i 4500 001 970488
003 DE-He213
005 20200705165404.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319286846 $9 978-3-319-28684-6
024 7 $a 10.1007/978-3-319-28684-6 $2 doi
035 $a 978-3-319-28684-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 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers / $c edited by Laura Sanità, Martin Skutella.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a X, 209 p. 24 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 9499
505 0 $a Algorithmic game theory -- Algorithmic trading -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Graph algorithms -- Inapproximability -- Mechanism design -- Natural algorithms -- Network design -- Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications.
520 $a This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015. The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems,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 Computers. $3 565115
650 0 $a Numerical analysis. $3 527939
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 Computation by Abstract Devices. $3 669792
650 2 4 $a Numeric Computing. $3 669943
700 1 $a Sanità, Laura. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1266047
700 1 $a Skutella, Martin. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 678740
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319286839
776 0 8 $i Printed edition: $z 9783319286853
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-28684-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)