1 option
WALCOM: Algorithms and Computation : 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings / edited by Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 11355
- Theoretical Computer Science and General Issues, 2512-2029 ; 11355
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science-Mathematics.
- Discrete mathematics.
- Numerical analysis.
- Artificial intelligence-Data processing.
- Discrete Mathematics in Computer Science.
- Numerical Analysis.
- Mathematical Applications in Computer Science.
- Data Science.
- Local Subjects:
- Algorithms.
- Discrete Mathematics in Computer Science.
- Numerical Analysis.
- Mathematical Applications in Computer Science.
- Data Science.
- Physical Description:
- 1 online resource (XVI, 420 pages) : 251 illustrations, 54 illustrations in color.
- Edition:
- 1st ed. 2019.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2019.
- System Details:
- text file PDF
- Summary:
- This book constitutes the proceedings of the 13th International Conference and Workshop on Algorithms and Computation, WALCOM 2019, held in Guwahati, India, in February/ March 2019. The 30 full papers presented were carefully reviewed and selected from 100 submissions. The papers are organized in topical headings on the facility location problem; computational geometry; graph drawing; graph algorithms; approximation algorithms; miscellaneous; data structures; parallel and distributed algorithms; and packing and covering.
- Contents:
- Invited Talks
- Facility Location Problem
- Computational Geometry
- Graph Drawing
- Graph Algorithms
- Approximation Algorithms
- Miscellaneous
- Data Structures
- Parallel and Distributed Algorithms
- Packing and Covering.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-10564-8
- 9783030105648
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.