| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466451103316 |
|
|
Titolo |
Algorithms and Discrete Applied Mathematics [[electronic resource] ] : 5th International Conference, CALDAM 2019, Kharagpur, India, February 14-16, 2019, Proceedings / / edited by Sudebkumar Prasant Pal, Ambat Vijayakumar |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2019.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XX, 287 p. 166 illus., 40 illus. in color.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 11394 |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Algorithms |
Computer science—Mathematics |
Discrete mathematics |
Numerical analysis |
Artificial intelligence—Data processing |
Computer graphics |
Discrete Mathematics in Computer Science |
Numerical Analysis |
Mathematical Applications in Computer Science |
Data Science |
Computer Graphics |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Approximation Algorithms -- Combinatorial Algorithms -- Combinatorial Optimization -- Computational Complexity -- Computational Geometry -- Data Structures -- Graph Algorithms -- Graph Drawing -- Parallel and Distributed Algorithms -- Parameterized Complexity -- Network Optimization -- Online Algorithms -- Randomized Algorithms -- Combinatorics -- Graph Theory -- Discrete Geometry. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the proceedings of the 5th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM |
|
|
|
|
|
|
|
|
|
|
2019, held in Kharagpur, India, in February 2019. The 22 papers presented together with 3 invited papers in this volume were carefully reviewed and selected from 86 submissions. The conference had papers in the areas of algorithms, graph theory, combinatorics, computational geometry, discrete geometry, and computational complexity. |
|
|
|
|
|
| |