國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Approximation and online algorithms1...

(1998 :)

Approximation and online algorithms18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020 : revised selected papers /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Approximation and online algorithmsedited by Christos Kaklamanis, Asaf Levin.
其他題名:	18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020 : revised selected papers /
其他題名:	WAOA 2020
其他作者:	Kaklamanis, Christos.
團體作者:
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	xii, 237 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Online algorithmsCongresses.
電子資源:	https://doi.org/10.1007/978-3-030-80879-2
ISBN:	9783030808792$q(electronic bk.)

Approximation and online algorithms18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020 : revised selected papers /
Approximation and online algorithms18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020 : revised selected papers /[electronic resource] :WAOA 2020edited by Christos Kaklamanis, Asaf Levin. - Cham :Springer International Publishing :2021. - xii, 237 p. :ill., digital ;24 cm. - Lecture notes in computer science,128060302-9743 ;. - Lecture notes in computer science ;4891..

Design and analysis of algorithms -- Online algorithms, approximation algorithms analysis -- Algorithmic game theory and mechanism design -- Parameterized complexity -- Scheduling algorithms -- Competitive analysis. Packing and covering problems -- Rounding techniques.

This book constitutes the thoroughly refereed workshop post-proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2019, held virtually in September 2020 as part of ALGO 2020. The 15 revised full papers presented this book were carefully reviewed and selected from 40 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, real-world applications. Chapter "Explorable Uncertainty in Scheduling with Non-Uniform Testing Times" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

ISBN: 9783030808792$q(electronic bk.)

Standard No.: 10.1007/978-3-030-80879-2doiSubjects--Topical Terms:

442929
Online algorithms
--Congresses.

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

Dewey Class. No.: 005.1

Approximation and online algorithms18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020 : revised selected papers /
LDR:02525nmm a2200361 a 4500 001 609420
003 DE-He213
005 20210706151409.0
006 m d
007 cr nn 008maaau
008 220222s2021 sz s 0 eng d
020 $a 9783030808792$q(electronic bk.)
020 $a 9783030808785$q(paper)
024 7 $a 10.1007/978-3-030-80879-2 $2 doi
035 $a 978-3-030-80879-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b W36 2020
072 7 $a PBKS $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b W251 2020
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Approximation and online algorithms $h [electronic resource] : $b 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020 : revised selected papers / $c edited by Christos Kaklamanis, Asaf Levin.
246 3 $a WAOA 2020
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xii, 237 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12806
490 1 $a Theoretical computer science and general issues
505 0 $a Design and analysis of algorithms -- Online algorithms, approximation algorithms analysis -- Algorithmic game theory and mechanism design -- Parameterized complexity -- Scheduling algorithms -- Competitive analysis. Packing and covering problems -- Rounding techniques.
520 $a This book constitutes the thoroughly refereed workshop post-proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2019, held virtually in September 2020 as part of ALGO 2020. The 15 revised full papers presented this book were carefully reviewed and selected from 40 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, real-world applications. Chapter "Explorable Uncertainty in Scheduling with Non-Uniform Testing Times" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
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 Algorithms. $3 184661
650 2 4 $a Symbolic and Algebraic Manipulation. $3 273720
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Data Structures and Information Theory. $3 825714
650 2 4 $a Theory of Computation. $3 274475
650 2 4 $a Computer Applications. $3 273760
700 1 $a Kaklamanis, Christos. $3 276306
700 1 $a Levin, Asaf. $3 906939
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
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-030-80879-2
950 $a Computer Science (SpringerNature-11645)