Algorithms and Computation [electronic resource] : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings / edited by Takao Asano, Shin-ichi Nakano, Yoshio Okamoto, Osamu Watanabe.

Contributor(s):

Series: Lecture Notes in Computer Science ; 7074Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: XVIII, 775 p. online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783642255915

Subject(s):

Genre/Form:

Electronic books.

Additional physical formats: Printed edition:: No titleDDC classification:

005.1 23

LOC classification:

QA76.9.A43

Online resources:

Click here to access online

In: Springer eBooksSummary: This book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as approximation algorithms; computational geometry; computational biology; computational complexity; data structures; distributed systems; graph algorithms; graph drawing and information visualization; optimization; online and streaming algorithms; parallel and external memory algorithms; parameterized algorithms; game theory and internet algorithms; randomized algorithms; and string algorithms.

Item type:

eBooks

Average rating: 0.0 (0 votes)

Holdings ( 0 )
Title notes ( 1 )

No physical items for this record

This book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as approximation algorithms; computational geometry; computational biology; computational complexity; data structures; distributed systems; graph algorithms; graph drawing and information visualization; optimization; online and streaming algorithms; parallel and external memory algorithms; parameterized algorithms; game theory and internet algorithms; randomized algorithms; and string algorithms.