logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Approximation And Online Algorithms 18th International Workshop Waoa 2020 Virtual Event September 910 2020 Revised Selected Papers Christos Kaklamanis

  • SKU: BELL-33393608
Approximation And Online Algorithms 18th International Workshop Waoa 2020 Virtual Event September 910 2020 Revised Selected Papers Christos Kaklamanis
$ 31.00 $ 45.00 (-31%)

4.1

10 reviews

Approximation And Online Algorithms 18th International Workshop Waoa 2020 Virtual Event September 910 2020 Revised Selected Papers Christos Kaklamanis instant download after payment.

Publisher: Springer
File Extension: PDF
File size: 4.93 MB
Pages: 249
Author: Christos Kaklamanis, Asaf Levin
ISBN: 9783030808785, 3030808785
Language: English
Year: 2021

Product desciption

Approximation And Online Algorithms 18th International Workshop Waoa 2020 Virtual Event September 910 2020 Revised Selected Papers Christos Kaklamanis by Christos Kaklamanis, Asaf Levin 9783030808785, 3030808785 instant download after payment.

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.

Related Products