WALCOM: Algorithms and Computation 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings
Aus der Reihe
Theoretical Computer Science and General Issues
-
- Taschenbuch ausgewählt
- eBook
-
Sprache:Englisch
-
Verlag:Springer
-
Auflage:1st ed. 2021
Fr. 62.90
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
31.01.2021
Herausgeber
Ryuhei Uehara + weitereVerlag
SpringerSeitenzahl
334
Maße (L/B/H)
23.5/15.5/1.8 cm
Gewicht
534 g
Auflage
1st ed. 2021
Sprache
Englisch
ISBN
978-3-030-68210-1
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 diverseareas 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.
The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverseareas 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.
Kundinnen und Kunden meinen
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kund*innen durch Ihre Meinung