| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466030503316 |
|
|
Titolo |
Algorithms and Data Structures [[electronic resource] ] : 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011, Proceedings / / edited by Frank Dehne, John Iacono, Jörg-Rüdiger Sack |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2011.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XV, 718 p. 179 illus., 58 illus. in color.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 6844 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Algorithms |
Artificial intelligence—Data processing |
Computer science—Mathematics |
Discrete mathematics |
Computer graphics |
Numerical analysis |
Computer networks |
Data Science |
Discrete Mathematics in Computer Science |
Computer Graphics |
Numerical Analysis |
Computer Communication Networks |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Piecewise-linear approximations of uncertain functions / Mohammad Ali Abam, Mark de Berg, Amirali Khosravi -- Constant factor approximation algorithm for boxicity of circular arc graphs / Abhijin Adiga, Jasine Babu, L. Sunil Chandran -- On the area requirements of Euclidean minimum spanning trees / Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 12th Algorithms and Data Structures Symposium, WADS 2011, held in New York, NY, |
|
|
|
|
|
|
|
|
|
|
USA, in August 2011. The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The 59 revised full papers presented in this volume were carefully reviewed and selected from 141 submissions. The papers present original research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry, databases, graphics, parallel and distributed computing. |
|
|
|
|
|
| |