國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Approximation and online algorithms1...

(1998 :)

Approximation and online algorithms17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, revised selected papers /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Approximation and online algorithmsedited by Evripidis Bampis, Nicole Megow.
其他題名:	17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, revised selected papers /
其他題名:	WAOA 2019
其他作者:	Bampis, Evripidis.
團體作者:
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	xii, 253 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer eBooks
標題:	Online algorithmsCongresses.
電子資源:	https://doi.org/10.1007/978-3-030-39479-0
ISBN:	9783030394790$q(electronic bk.)

Approximation and online algorithms17th 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] :WAOA 2019edited by Evripidis Bampis, Nicole Megow. - Cham :Springer International Publishing :2020. - xii, 253 p. :ill. (some col.), digital ;24 cm. - Theoretical computer science and general issues ;11926. - Theoretical computer science and general issues ;11195..

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$q(electronic bk.)

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

442929
Online algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 518

Approximation and online algorithms17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, revised selected papers /
LDR:02377nmm a2200349 a 4500 001 573679
003 DE-He213
005 20200624170757.0
006 m d
007 cr nn 008maaau
008 200928s2020 sz s 0 eng d
020 $a 9783030394790$q(electronic bk.)
020 $a 9783030394783$q(paper)
024 7 $a 10.1007/978-3-030-39479-0 $2 doi
035 $a 978-3-030-39479-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
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
090 $a QA76.9.A43 $b W251 2019
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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.
246 3 $a WAOA 2019
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xii, 253 p. : $b ill. (some col.), digital ; $c 24 cm.
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 Online algorithms $v Congresses. $3 442929
650 0 $a Approximation algorithms $v Congresses. $3 510892
650 0 $a Computer science $x Mathematics. $3 181991
650 1 4 $a Computational Mathematics and Numerical Analysis. $3 274020
650 2 4 $a Computer Systems Organization and Communication Networks. $3 273709
650 2 4 $a Information Systems Applications (incl. Internet) $3 530743
650 2 4 $a Theory of Computation. $3 274475
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Symbolic and Algebraic Manipulation. $3 273720
700 1 $a Bampis, Evripidis. $3 279051
700 1 $a Megow, Nicole. $3 861040
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Theoretical computer science and general issues ; $v 11195. $3 824674
856 4 0 $u https://doi.org/10.1007/978-3-030-39479-0
950 $a Mathematics and Statistics (Springer-11649)