WALCOM: Algorithms and Computation [recurso electrónico] : 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings / edited by Naoki Katoh, Amit Kumar.
Tipo de material:
TextoSeries Lecture Notes in Computer Science ; 6552Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Descripción: XI, 233p. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642190940Tema(s): Computer science | Computer software | Computational complexity | Algebra -- Data processing | Bioinformatics | Algorithms | Computer Science | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Math Applications in Computer Science | Symbolic and Algebraic Manipulation | Computational Biology/Bioinformatics | AlgorithmsFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 005.1 Clasificación LoC:QA76.9.A43Recursos en línea: Libro electrónico
En: Springer eBooksResumen: This book constitutes the proceedings of the 5th International Workshop on Algorithms and Computation, WALCOM 2011, held in New Delhi, India, in February 2011. The 20 papers presented in this volume were carefully reviewed and selected from 57 submissions. The papers are grouped in topical sections on approximation algorithms, hardness, algorithm engineering, computational geometry, string algorithms, and graph algorithms.
| Tipo de ítem | Biblioteca actual | Colección | Signatura | Copia número | Estado | Fecha de vencimiento | Código de barras |
|---|---|---|---|---|---|---|---|
| Libro Electrónico | Biblioteca Electrónica | Colección de Libros Electrónicos | QA76.9 .A43 (Browse shelf(Abre debajo)) | 1 | No para préstamo | 375764-2001 |
This book constitutes the proceedings of the 5th International Workshop on Algorithms and Computation, WALCOM 2011, held in New Delhi, India, in February 2011. The 20 papers presented in this volume were carefully reviewed and selected from 57 submissions. The papers are grouped in topical sections on approximation algorithms, hardness, algorithm engineering, computational geometry, string algorithms, and graph algorithms.
19
