國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Approximation and online algorithmsI...

(1998 :)

Approximation and online algorithmsInternational Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021 : revised selected papers /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Approximation and online algorithmsedited by Jochen Koenemann, Britta Peis.
其他題名:	International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021 : revised selected papers /
其他題名:	WAOA 2021
其他作者:	Koenemann, Jochen.
團體作者:
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	xii, 275 p. :ill. (some col.), digital ;24 cm.
附註:	"WAOA 2021 took place virtually in Lisbon, Portugal"-- Preface.
Contained By:	Springer Nature eBook
標題:	Online algorithmsCongresses.
電子資源:	https://doi.org/10.1007/978-3-030-92702-8
ISBN:	9783030927028$q(electronic bk.)

Approximation and online algorithmsInternational Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021 : revised selected papers /
Approximation and online algorithmsInternational Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021 : revised selected papers /[electronic resource] :WAOA 2021edited by Jochen Koenemann, Britta Peis. - Cham :Springer International Publishing :2021. - xii, 275 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,129820302-9743 ;. - Lecture notes in computer science ;4891..

"WAOA 2021 took place virtually in Lisbon, Portugal"-- Preface.

How to Navigate Through Obstacles -- Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle -- Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set -- An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity -- Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs -- On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem -- The Traveling k-Median Problem: Approximating Optimal Network Coverage -- EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource -- Several methods of analysis for cardinality constrained bin packing -- Leah Epstein Weighted completion time minimization for capacitated parallel machines -- Server Cloud Scheduling -- FIFO and Randomized Competitive Packet Routing Games -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Analysis of Online Balanced Clustering -- Precedence-Constrained Covering Problems with Multiplicity Constraints -- Contention Resolution, Matrix Scaling and Fair Allocation.

This book constitutes the thoroughly refereed workshop post-proceedings of the 19th International Workshop on Approximation and Online Algorithms, WAOA 2021, held in September 2021. Due to COVID-19 pandemic the conference was held virtually. The 16 revised full papers presented in this book were carefully reviewed and selected from 31 submissions. The papers focus on the design and analysis of algorithms for online and computationally hard problems.

ISBN: 9783030927028$q(electronic bk.)

Standard No.: 10.1007/978-3-030-92702-8doiSubjects--Topical Terms:

442929
Online algorithms
--Congresses.

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

Dewey Class. No.: 005.1

Approximation and online algorithmsInternational Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021 : revised selected papers /
LDR:03029nmm a2200373 a 4500 001 616001
003 DE-He213
005 20220223213240.0
006 m d
007 cr nn 008maaau
008 220831s2021 sz s 0 eng d
020 $a 9783030927028$q(electronic bk.)
020 $a 9783030927011$q(paper)
024 7 $a 10.1007/978-3-030-92702-8 $2 doi
035 $a 978-3-030-92702-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b W36 2021
072 7 $a PBKS $2 bicssc
072 7 $a MAT006000 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b A652 2021
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Approximation and online algorithms $h [electronic resource] : $b International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021 : revised selected papers / $c edited by Jochen Koenemann, Britta Peis.
246 3 $a WAOA 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xii, 275 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12982
490 1 $a Theoretical computer science and general issues
500 $a "WAOA 2021 took place virtually in Lisbon, Portugal"-- Preface.
505 0 $a How to Navigate Through Obstacles -- Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle -- Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set -- An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity -- Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs -- On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem -- The Traveling k-Median Problem: Approximating Optimal Network Coverage -- EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource -- Several methods of analysis for cardinality constrained bin packing -- Leah Epstein Weighted completion time minimization for capacitated parallel machines -- Server Cloud Scheduling -- FIFO and Randomized Competitive Packet Routing Games -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Analysis of Online Balanced Clustering -- Precedence-Constrained Covering Problems with Multiplicity Constraints -- Contention Resolution, Matrix Scaling and Fair Allocation.
520 $a This book constitutes the thoroughly refereed workshop post-proceedings of the 19th International Workshop on Approximation and Online Algorithms, WAOA 2021, held in September 2021. Due to COVID-19 pandemic the conference was held virtually. The 16 revised full papers presented in this book were carefully reviewed and selected from 31 submissions. The papers focus on the design and analysis of algorithms for online and computationally hard problems.
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
700 1 $a Koenemann, Jochen. $3 841026
700 1 $a Peis, Britta. $3 914915
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-92702-8
950 $a Computer Science (SpringerNature-11645)