國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

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

切換: 標籤 | MARC模式 | ISBD

Approximation and online algorithms1...

(1998 :)

Approximation and online algorithms16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018 : revised selected papers /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Approximation and online algorithmsedited by Leah Epstein, Thomas Erlebach.
其他題名:	16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018 : revised selected papers /
其他題名:	WAOA 2018
其他作者:	Epstein, Leah.
團體作者:
出版者:	Cham :Springer International Publishing :2018.
面頁冊數:	x, 349 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Online algorithmsCongresses.
電子資源:	https://doi.org/10.1007/978-3-030-04693-4
ISBN:	9783030046934$q(electronic bk.)

Approximation and online algorithms16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018 : revised selected papers /
Approximation and online algorithms16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018 : revised selected papers /[electronic resource] :WAOA 2018edited by Leah Epstein, Thomas Erlebach. - Cham :Springer International Publishing :2018. - x, 349 p. :ill., digital ;24 cm. - Lecture notes in computer science,113120302-9743 ;. - Lecture notes in computer science ;4891..

Some Easy and Some Not So Easy Geometric Optimization Problems -- Deterministic Min-Cost Matching with Delays -- Sequential Metric Dimension -- A Primal-Dual Online Deterministic Algorithm for Matching with Delays -- Advice Complexity of Priority Algorithms -- Approximating Node-Weighted k-MST on Planar Graphs -- Exploring Sparse Graphs with Advice -- Call Admission Problems on Grids with Advice -- Improved Approximation Algorithms for Minimum Power Covering Problems -- DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals -- Strategic Contention Resolution in Multiple Channels -- Sublinear Graph Augmentation for Fast Query Implementation -- Bin Packing Games with Weight Decision: How To Get a Small Value for the Price of Anarchy -- Probabilistic Embeddings of the Frechet Distance -- Algorithms for Dynamic NFV Workload -- Longest Increasing Subsequence under Persistent Comparison Errors -- Cut Sparsifiers for Balanced Digraphs -- Reconfiguration of Graphs with Connectivity Constraints -- The Itinerant List Update Problem -- The Price of Fixed Assignments in Stochastic Extensible Bin Packing.

This book constitutes the thoroughly refereed workshop post-proceedings of the 16th International Workshop on Approximation and Online Algorithms, WAOA 2018, held in Helsinki, Finland, in August 2018 as part of ALGO 2018. The 19 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 44 submissions. Topics of interest for WAOA 2016 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: 9783030046934$q(electronic bk.)

Standard No.: 10.1007/978-3-030-04693-4doiSubjects--Topical Terms:

442929
Online algorithms
--Congresses.

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

Dewey Class. No.: 005.1

Approximation and online algorithms16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018 : revised selected papers /
LDR:03265nmm a2200361 a 4500 001 547236
003 DE-He213
005 20181128161035.0
006 m d
007 cr nn 008maaau
008 190709s2018 gw s 0 eng d
020 $a 9783030046934$q(electronic bk.)
020 $a 9783030046927$q(paper)
024 7 $a 10.1007/978-3-030-04693-4 $2 doi
035 $a 978-3-030-04693-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b W36 2018
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 2018
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Approximation and online algorithms $h [electronic resource] : $b 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018 : revised selected papers / $c edited by Leah Epstein, Thomas Erlebach.
246 3 $a WAOA 2018
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a x, 349 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11312
490 1 $a Theoretical computer science and general issues
505 0 $a Some Easy and Some Not So Easy Geometric Optimization Problems -- Deterministic Min-Cost Matching with Delays -- Sequential Metric Dimension -- A Primal-Dual Online Deterministic Algorithm for Matching with Delays -- Advice Complexity of Priority Algorithms -- Approximating Node-Weighted k-MST on Planar Graphs -- Exploring Sparse Graphs with Advice -- Call Admission Problems on Grids with Advice -- Improved Approximation Algorithms for Minimum Power Covering Problems -- DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals -- Strategic Contention Resolution in Multiple Channels -- Sublinear Graph Augmentation for Fast Query Implementation -- Bin Packing Games with Weight Decision: How To Get a Small Value for the Price of Anarchy -- Probabilistic Embeddings of the Frechet Distance -- Algorithms for Dynamic NFV Workload -- Longest Increasing Subsequence under Persistent Comparison Errors -- Cut Sparsifiers for Balanced Digraphs -- Reconfiguration of Graphs with Connectivity Constraints -- The Itinerant List Update Problem -- The Price of Fixed Assignments in Stochastic Extensible Bin Packing.
520 $a This book constitutes the thoroughly refereed workshop post-proceedings of the 16th International Workshop on Approximation and Online Algorithms, WAOA 2018, held in Helsinki, Finland, in August 2018 as part of ALGO 2018. The 19 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 44 submissions. Topics of interest for WAOA 2016 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 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 Data Structures. $3 273992
650 2 4 $a Numeric Computing. $3 275524
650 2 4 $a Computer Systems Organization and Communication Networks. $3 273709
700 1 $a Epstein, Leah. $3 573052
700 1 $a Erlebach, Thomas. $3 279048
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-030-04693-4
950 $a Computer Science (Springer-11645)