Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Algorithm Theory -- SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland,

Algorithm Theory -- SWAT 2012

13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012, Proceedings

Fomin, Fedor V., Kaski, Petteri (Eds.)

2012, XIII, 410p. 62 illus..

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$69.99

(net) price for USA

ISBN 978-3-642-31155-0

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$99.00

(net) price for USA

ISBN 978-3-642-31154-3

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • State-of-the-art research
  • Fast-track conference proceedings
  • Unique visibility
This book constitutes the refereed proceedings of the 13th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012, held in Helsinki, Finland, in July 2012, co-located with the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012. The 34 papers were carefully reviewed and selected from a total of 127 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures.

Content Level » Research

Keywords » approximation algorithms - complexity - graph algorithms - pattern matching - string algorithms

Related subjects » Computational Science & Engineering - Theoretical Computer Science

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.