Cantitate/Preț
Produs

Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings: Lecture Notes in Computer Science, cartea 7676

Editat de Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee
en Limba Engleză Paperback – 30 oct 2012
This book constitutes the refereed proceedings of the 23rd International Symposium on Algorithms and Computation, ISAAC 2012, held in Taipei, Taiwan, in December 2012. The 68 revised full papers presented together with three invited talks were carefully reviewed and selected from 174 submissions for inclusion in the book. This volume contains topics such as graph algorithms; online and streaming algorithms; combinatorial optimization; computational complexity; computational geometry; string algorithms; approximation algorithms; graph drawing; data structures; randomized algorithms; and algorithmic game theory.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 34326 lei

Preț vechi: 42907 lei
-20% Nou

Puncte Express: 515

Preț estimativ în valută:
6569 6889$ 5478£

Carte tipărită la comandă

Livrare economică 07-21 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642352607
ISBN-10: 364235260X
Pagini: 720
Ilustrații: XVII, 702 p. 117 illus.
Dimensiuni: 155 x 235 x 38 mm
Greutate: 0.99 kg
Ediția:2012
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Graph algorithms.- online and streaming algorithms.- combinatorial optimization.- computational complexity.- computational geometry.- string algorithms.- approximation algorithms.- graph drawing.- data structures.- randomized algorithms.- algorithmic game theory.

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 23rd International Symposium on Algorithms and Computation, ISAAC 2012, held in Taipei, Taiwan, in December 2012. The 68 revised full papers presented together with three invited talks were carefully reviewed and selected from 174 submissions for inclusion in the book. This volume contains topics such as graph algorithms; online and streaming algorithms; combinatorial optimization; computational complexity; computational geometry; string algorithms; approximation algorithms; graph drawing; data structures; randomized algorithms; and algorithmic game theory.

Caracteristici

Up to date results Fast track conference proceedings State of the art research