Approximation and Online Algorithms: 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers

Author:   Evripidis Bampis ,  Nicole Megow
Publisher:   Springer Nature Switzerland AG
Edition:   1st ed. 2020
Volume:   11926
ISBN:  

9783030394783


Pages:   253
Publication Date:   25 January 2020
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $129.35 Quantity:  
Add to Cart

Share |

Approximation and Online Algorithms: 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers


Add your own review!

Overview

This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019. The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 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; and real-world applications.

Full Product Details

Author:   Evripidis Bampis ,  Nicole Megow
Publisher:   Springer Nature Switzerland AG
Imprint:   Springer Nature Switzerland AG
Edition:   1st ed. 2020
Volume:   11926
Weight:   0.454kg
ISBN:  

9783030394783


ISBN 10:   3030394786
Pages:   253
Publication Date:   25 January 2020
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Graph Algorithms.- Inapproximability Results.- Network Design.- Design and Analysis of Approximation and Online Algorithms.- Parameterized Complexity.- Algorithmic Game Theory.- Algorithmic trading.-  Competitive analysis.- Computational Advertising.- Computational finance.- Geometric problems.- Mechanism Design. 

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

Aorrng

Shopping Cart
Your cart is empty
Shopping cart
Mailing List