Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India,

WALCOM: Algorithms and Computation

5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011, Proceedings

KATOH, NAOKI, Kumar, Amit (Eds.)

2011, XI, 233p.

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-19094-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.

 
$89.99

(net) price for USA

ISBN 978-3-642-19093-3

free shipping for individuals worldwide

online orders shipping within 2-3 days.


add to marked items

  • fast track conference proceedings
This book constitutes the proceedings of the 5th International Workshop on Algorithms and Computation, WALCOM 2011, held in New Delhi, India, in February 2011.
The 20 papers presented in this volume were carefully reviewed and selected from 57 submissions.  The papers are grouped in topical sections on approximation algorithms, hardness, algorithm engineering, computational geometry, string algorithms, and graph algorithms.

Content Level » Research

Keywords » approximation algorithms - biconvex graphs - complexity - computational geometry - data structures - dynamic programming - lattice reduction - longest path problem - moving points - peer-to-peer systems - planar graphs - polynomial algorithm - probabilistic methods - shortest path - tree drawing

Related subjects » Bioinformatics - 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.