ENGLISH

Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings

By Kun-Mao Chao , Tsan-sheng Hsu , Der-Tsai Lee (eds.) , John E. Hopcroft (auth.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2012
ISBN
978-3-642-35260-7, 978-3-642-35261-4
DOI
10.1007/978-3-642-35261-4
Language
english
Format
PDF
Filesize
8 MB (8859176 bytes)
Series
Lecture Notes in Computer Science 7676 Theoretical Computer Science and General Issues
Edition
1
Pages
702\715
Time added
2013-12-12 02:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

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.

Similar books