Theoretical Computer Science and General Issues
cover

WALCOM: Algorithms and Computation

15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings

Editors: Uehara, Ryuhei, Hong, Seok-Hee, Nandy, Subhas C (Eds.)

Buy this book

eBook $59.99
price for USA in USD
  • ISBN 978-3-030-68211-8
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $79.99
price for USA in USD
  • ISBN 978-3-030-68210-1
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Covid-19 shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
About this book

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. 

Table of contents (26 chapters)

Table of contents (26 chapters)
  • Majority Spanning Trees, Cotrees and Their Applications

    Pages 3-12

    Kaykobad, Mohammad (et al.)

  • A New Transportation Problem on a Graph with Sending and Bringing-Back Operations

    Pages 13-24

    Asano, Tetsuo

  • Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees

    Pages 27-39

    Wang, Haitao (et al.)

  • On Short Fastest Paths in Temporal Graphs

    Pages 40-51

    Danda, Umesh Sandeep (et al.)

  • Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights

    Pages 52-64

    Fujie, Tetsuya (et al.)

Buy this book

eBook $59.99
price for USA in USD
  • ISBN 978-3-030-68211-8
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $79.99
price for USA in USD
  • ISBN 978-3-030-68210-1
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Covid-19 shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
WALCOM: Algorithms and Computation
Book Subtitle
15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings
Editors
  • Ryuhei Uehara
  • Seok-Hee Hong
  • Subhas C Nandy
Series Title
Theoretical Computer Science and General Issues
Series Volume
12635
Copyright
2021
Publisher
Springer International Publishing
Copyright Holder
Springer Nature Switzerland AG
eBook ISBN
978-3-030-68211-8
DOI
10.1007/978-3-030-68211-8
Softcover ISBN
978-3-030-68210-1
Edition Number
1
Number of Pages
XV, 334
Number of Illustrations
53 b/w illustrations, 55 illustrations in colour
Topics