Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 11355)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: WALCOM 2019.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (33 papers)
-
Front Matter
-
Facility Location Problem
-
Front Matter
-
-
Computational Geometry
-
Front Matter
-
-
Graph Algorithms
-
Front Matter
-
Other volumes
-
WALCOM: Algorithms and Computation
Keywords
- approximation algorithms
- approximation algorithms analysis
- cluster
- clustering
- computational geometry
- computer graphics
- data structures design
- directed graphs
- distributed algorithms
- graph algorithms
- graph algorithms analysis
- graph theory
- parallel algorithms
- parallel processing systems
- problem solving
- theory of computation
- algorithm analysis and problem complexity
- data structures
About this book
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.
Editors and Affiliations
Bibliographic Information
Book Title: WALCOM: Algorithms and Computation
Book Subtitle: 13th International Conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, Proceedings
Editors: Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-030-10564-8
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2019
Softcover ISBN: 978-3-030-10563-1Published: 21 December 2018
eBook ISBN: 978-3-030-10564-8Published: 20 February 2019
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XVI, 420
Number of Illustrations: 197 b/w illustrations, 54 illustrations in colour
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Numeric Computing, Math Applications in Computer Science, Data Structures