大葉大學圖書館 |

Approximation and online algorithms[electronic resource] :13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015 : revised selected papers /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	005.1
書名/作者:	Approximation and online algorithms : 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015 : revised selected papers // edited by Laura Sanita, Martin Skutella.
其他題名:	WAOA 2015
其他作者:	Sanita, Laura.
團體作者:	Clark Conference
出版者:	Cham : : Springer International Publishing :, 2015.
面頁冊數:	x, 209 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Online algorithms - Congresses.
標題:	Approximation algorithms - Congresses.
標題:	Computer Science.
標題:	Algorithm Analysis and Problem Complexity.
標題:	Discrete Mathematics in Computer Science.
標題:	Data Structures.
標題:	Algorithms.
標題:	Computation by Abstract Devices.
標題:	Numeric Computing.
ISBN:	9783319286846
ISBN:	9783319286839
內容註:	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.
電子資源:	http://dx.doi.org/10.1007/978-3-319-28684-6

Approximation and online algorithms[electronic resource] :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] :WAOA 2015edited by Laura Sanita, Martin Skutella. - Cham :Springer International Publishing :2015. - x, 209 p. :ill., digital ;24 cm. - Lecture notes in computer science,94990302-9743 ;. - Lecture notes in computer science ;7103..

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:

468977
Online algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Approximation and online algorithms[electronic resource] :13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015 : revised selected papers /
LDR:02426nam a2200337 a 4500 001 444782
003 DE-He213
005 20160524165321.0
006 m d
007 cr nn 008maaau
008 160715s2015 gw s 0 eng d
020 $a 9783319286846 $q (electronic bk.)
020 $a 9783319286839 $q (paper)
024 7 $a 10.1007/978-3-319-28684-6 $2 doi
035 $a 978-3-319-28684-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b W251 2015
111 2 $a Clark Conference $d (2005 : $c Sterling and Francine Clark Art Institute) $3 347558
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 Sanita, Martin Skutella.
246 3 $a WAOA 2015
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a x, 209 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $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 Online algorithms $v Congresses. $3 468977
650 0 $a Approximation algorithms $v Congresses. $3 468978
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 463701
650 2 4 $a Discrete Mathematics in Computer Science. $3 464912
650 2 4 $a Data Structures. $3 467911
650 2 4 $a Algorithms. $3 182797
650 2 4 $a Computation by Abstract Devices. $3 463641
650 2 4 $a Numeric Computing. $3 466954
700 1 $a Sanita, Laura. $3 636557
700 1 $a Skutella, Martin. $3 636558
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 7103. $3 466200
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-28684-6
950 $a Computer Science (Springer-11645)