Approximation and Online Algorithms
19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected Papers
(Sprache: Englisch)
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...
The...
Voraussichtlich lieferbar in 3 Tag(en)
versandkostenfrei
Buch (Kartoniert)
Fr. 68.50
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „Approximation and Online Algorithms “
Klappentext zu „Approximation and Online Algorithms “
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.
Inhaltsverzeichnis zu „Approximation and Online Algorithms “
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.
Bibliographische Angaben
- 2021, 1st ed. 2021, XII, 275 Seiten, 12 farbige Abbildungen, Masse: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Herausgegeben: Jochen Koenemann, Britta Peis
- Verlag: Springer, Berlin
- ISBN-10: 3030927016
- ISBN-13: 9783030927011
Sprache:
Englisch
Kommentar zu "Approximation and Online Algorithms"
0 Gebrauchte Artikel zu „Approximation and Online Algorithms“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Approximation and Online Algorithms".
Kommentar verfassen