國立虎尾科技大學 |

Approximation and Online Algorithms = 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Approximation and Online Algorithms/ edited by Jochen Koenemann, Britta Peis.
其他題名:	19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers /
其他作者:	Peis, Britta.
面頁冊數:	XII, 275 p. 24 illus., 12 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computational Mathematics and Numerical Analysis. -
電子資源:	https://doi.org/10.1007/978-3-030-92702-8
ISBN:	9783030927028

Approximation and Online Algorithms = 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers /
Approximation and Online Algorithms19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers /[electronic resource] :edited by Jochen Koenemann, Britta Peis. - 1st ed. 2021. - XII, 275 p. 24 illus., 12 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12982. - Theoretical Computer Science and General Issues ;9163.

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

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

669338
Computational Mathematics and Numerical Analysis.

LC Class. No.: QA71-90

Dewey Class. No.: 518

Approximation and Online Algorithms = 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers /
LDR:03215nam a22004095i 4500 001 1057936
003 DE-He213
005 20211222171844.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030927028 $9 978-3-030-92702-8
024 7 $a 10.1007/978-3-030-92702-8 $2 doi
035 $a 978-3-030-92702-8
050 4 $a QA71-90
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
245 1 0 $a Approximation and Online Algorithms $h [electronic resource] : $b 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / $c edited by Jochen Koenemann, Britta Peis.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XII, 275 p. 24 illus., 12 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 12982
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 1 4 $a Computational Mathematics and Numerical Analysis. $3 669338
650 0 $a Computer mathematics. $3 1199796
700 1 $a Peis, Britta. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1267628
700 1 $a Koenemann, Jochen. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1226511
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030927011
776 0 8 $i Printed edition: $z 9783030927035
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-92702-8
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
912 $a ZDB-2-LNC
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)