Approximation and Online Algorithms: 22nd International Workshop, WAOA 2024, Egham, UK, September 5–6,...

— —

Marcin Bieńkowski Matthias Englert

Approximation and Online Algorithms

22nd International Workshop, WAOA 2024, Egham, UK, September 5–6, 2024, Proceedings

Marcin Bieńkowski, Matthias Englert

$125.95 $100.80

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Springer International Publishing AG
12 February 2025

Information theory; Discrete mathematics; Numerical analysis; Algorithms & data structures; Maths for computer scientists

Series: Lecture Notes in Computer Science

Summary
Details

This book constitutes the refereed proceedings of the 22nd International Workshop on Approximation and Online Algorithms, WAOA 2024, held in Egham, UK, during September 5–6, 2024.

The 15 full papers included in this book were carefully reviewed and selected from 47 submissions. They were organized in topical sections as follows: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for designing and analyzing approximation and online algorithms, resource augmentation, and scheduling problems.

Edited by: Marcin Bieńkowski, Matthias Englert
Imprint: Springer International Publishing AG
Country of Publication: Switzerland
Volume: 15269
Dimensions: Height: 235mm, Width: 155mm,
ISBN: 9783031813955
ISBN 10: 3031813952
Series: Lecture Notes in Computer Science
Pages: 229
Publication Date: 12 February 2025
Audience: Professional and scholarly , College/higher education , Undergraduate , Further / Higher Education
Format: Paperback
Publisher's Status: Active