|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910483607203321 |
|
|
Titolo |
Algorithm Theory - SWAT 2010 : 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings / / edited by Haim Kaplan |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
|
|
|
|
|
|
|
|
|
ISBN |
|
1-280-38728-9 |
9786613565204 |
3-642-13731-8 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2010.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (448 p. 69 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 6139 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer programming |
Algorithms |
Computer science—Mathematics |
Discrete mathematics |
Computer graphics |
Artificial intelligence—Data processing |
Computer science |
Programming Techniques |
Discrete Mathematics in Computer Science |
Computer Graphics |
Data Science |
Theory of Computation |
|
|
|
|
|
|
|
|
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 |
|
Optimal Exploration of Terrains with Obstacles -- Reconstructing a Simple Polygon from Its Angles -- Semidefinite Programming and Approximation Algorithms: A Survey -- Strictly-Regular Number System and Data Structures -- An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times -- The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition -- A Bottom-Up Method and Fast Algorithms for max independent set -- |
|
|
|
|