Dear customers, due to a public holiday, customer support is not available today. We will attend to your requests the next business day. Thank you for your understanding.

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Austrian Post 5.49 € DPD courier 3.99 € DPD point 2.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Dear customers, due to a public holiday, customer support is not available today. We will attend to your requests the next business day. Thank you for your understanding.

Algorithms and Computation

Name: Algorithms and Computation
Brand: Springer, Berlin
SKU: 01657130
Price: 118.39 EUR
Availability: InStock
Author: Otfried Cheong
ISBN: 9783642175138

21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II

Otfried Cheong

Kyung-Yong Chwa

Kunsoo Park

Language

English

Book Paperback

Libristo code: 01657130

Publishers Springer, Berlin, November 2009

This book constitutes the refereed proceedings of the 21st International Symposium on Algorithms and... Full description

Libristo code: 01657130

290 b

118.39 € VAT included

In stock at our supplier Shipping in 9-15 days

Delivery to Austria

30-day return policy

Customers also purchased

Schau doch mal rein! Günter Müller

Hardback

19.90 €

Alles klar? Übungsbuch Eleni Pyreni

Paperback

13.19 €

Der Mitternachtspalast Carlos Ruiz Zafón

Paperback

9.99 €

Mauerriss Dieter Bührig

Paperback

16.00 €

Aus Den Vogesen Karl E. Franzos

Paperback

24.90 €

World Record Neil Young with Crazy Horse

Audio CD

27.49 €

Los siete hermanitos - Book + CD Cecilia Pisos

Paperback

15.39 €

This book constitutes the refereed proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC 2010, held in Jeju, South Korea in December 2010.§The 77 revised full papers presented were carefully reviewed and selected from 182 submissions for inclusion in the book. This volume contains topics such as approximation algorithm; complexity; data structure and algorithm; combinatorial optimization; graph algorithm; computational geometry; graph coloring; fixed parameter tractability; optimization; online algorithm; and scheduling.