WALCOM: Algorithms and Computation | 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings

Ryuhei Uehara (u. a.)

ISBN 10: 3030682102 / ISBN 13: 9783030682101

Published by Springer, 2021

About this Item

WALCOM: Algorithms and Computation | 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings | Ryuhei Uehara (u. a.) | Taschenbuch | xv | Englisch | 2021 | Springer | EAN 9783030682101 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Seller Inventory # 119493560

Bibliographic Details

• Title: WALCOM: Algorithms and Computation | 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings
• Publisher: Springer
• Publication Date: 2021
• Language: English
• ISBN 10: 3030682102
• ISBN 13: 9783030682101
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 18D millimeters 235 millimeters width by 155 millimeters height by 18 millimeters depth
• Weight: 494 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

This book constitutes the proceedings of the 15th International Conference on Algorithms and Computation, WALCOM 2021, which was planned to take place in Yangon, Myanmar in February/March 2021. The conference changed to an online format due to the COVID-19 pandemic. 

The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverse

areas of algorithms and computation, such as approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.