國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁 到查詢結果 [ subject:"Approximation algorithms" ]

切換: 標籤 | MARC模式 | ISBD

Approximation and online algorithms1...

(1998 :)

Approximation and online algorithms15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017 : revised selected papers /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Approximation and online algorithmsedited by Roberto Solis-Oba, Rudolf Fleischer.
其他題名:	15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017 : revised selected papers /
其他題名:	WAOA 2017
其他作者:	Solis-Oba, Roberto.
團體作者:
出版者:	Cham :Springer International Publishing :2018.
面頁冊數:	x, 329 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Online algorithmsCongresses.
電子資源:	https://doi.org/10.1007/978-3-319-89441-6
ISBN:	9783319894416$q(electronic bk.)

Approximation and online algorithms15th 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] :WAOA 2017edited by Roberto Solis-Oba, Rudolf Fleischer. - Cham :Springer International Publishing :2018. - x, 329 p. :ill., digital ;24 cm. - Lecture notes in computer science,107870302-9743 ;. - Lecture notes in computer science ;4891..

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

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

442929
Online algorithms
--Congresses.

LC Class. No.: QA76.9.A43 / W36 2017

Dewey Class. No.: 005.1

Approximation and online algorithms15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017 : revised selected papers /
LDR:02524nmm a2200361 a 4500 001 568549
003 DE-He213
005 20191028142533.0
006 m d
007 cr nn 008maaau
008 200707s2018 sz s 0 eng d
020 $a 9783319894416$q(electronic bk.)
020 $a 9783319894409$q(paper)
024 7 $a 10.1007/978-3-319-89441-6 $2 doi
035 $a 978-3-319-89441-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b W36 2017
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
090 $a QA76.9.A43 $b W251 2017
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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.
246 3 $a WAOA 2017
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a x, 329 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10787
490 1 $a Theoretical computer science and general issues
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 Online algorithms $v Congresses. $3 442929
650 0 $a Approximation algorithms $v Congresses. $3 510892
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Numeric Computing. $3 275524
650 2 4 $a Data Structures. $3 273992
650 2 4 $a Computer Communication Networks. $3 218087
650 2 4 $a Computer Graphics. $3 274515
700 1 $a Solis-Oba, Roberto. $3 284429
700 1 $a Fleischer, Rudolf. $3 283884
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-319-89441-6
950 $a Computer Science (Springer-11645)