Vai al contenuto principale della pagina
Titolo: |
WALCOM: Algorithms and Computation [[electronic resource] ] : 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
![]() |
Pubblicazione: | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
Edizione: | 1st ed. 2019. |
Descrizione fisica: | 1 online resource (XV, 420 p. 298 illus., 64 illus. in color.) |
Disciplina: | 005.1 |
Soggetto topico: | 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 | |
Persona (resp. second.): | DasGautam K |
MandalPartha S | |
MukhopadhyayaKrishnendu | |
NakanoShin-ichi | |
Nota di contenuto: | Invited Talks -- Facility Location Problem -- Computational Geometry -- Graph Drawing -- Graph Algorithms -- Approximation Algorithms -- Miscellaneous -- Data Structures -- Parallel and Distributed Algorithms -- Packing and Covering. |
Sommario/riassunto: | 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. |
Titolo autorizzato: | WALCOM: Algorithms and Computation ![]() |
ISBN: | 3-030-10564-4 |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996466430003316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |