Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 12601)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: CALDAM 2021.
Buy print copy
About this book
This book constitutes the proceedings of the 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021, which was held in Rupnagar, India, during February 11-13, 2021. The 39 papers presented in this volume were carefully reviewed and selected from 82 submissions. The papers were organized in topical sections named: approximation algorithms; parameterized algorithms; computational geometry; graph theory; combinatorics and algorithms; graph algorithms; and computational complexity.
Similar content being viewed by others
Keywords
- approximation algorithms
- approximation theory
- bipartite graphs
- combinatorial mathematics
- communication systems
- computer networks
- computer systems
- directed graphs
- distributed computer systems
- engineering
- graph g
- graph theory
- graphic methods
- mathematics
- polynomial approximation
- probability
- signal processing
- weighted graph
Table of contents (39 papers)
-
Front Matter
-
Approximation Algorithms
-
Front Matter
-
-
Parameterized Algorithms
-
Front Matter
-
-
Graph Theory
-
Front Matter
-
Other volumes
-
Algorithms and Discrete Applied Mathematics
Editors and Affiliations
Bibliographic Information
Book Title: Algorithms and Discrete Applied Mathematics
Book Subtitle: 7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings
Editors: Apurva Mudgal, C. R. Subramanian
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-030-67899-9
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2021
Softcover ISBN: 978-3-030-67898-2Published: 20 January 2021
eBook ISBN: 978-3-030-67899-9Published: 28 January 2021
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XVIII, 514
Number of Illustrations: 60 b/w illustrations, 40 illustrations in colour
Topics: Mathematics of Computing, Algorithm Analysis and Problem Complexity, Data Structures and Information Theory, Computational Mathematics and Numerical Analysis