Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Algorithms and Computation - 8th International Workshop, WALCOM 2014, Chennai, India, February

Algorithms and Computation

8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings

Pal, Sudebkumar Prasant, Sadakane, Kunihiko (Eds.)

2014, XIV, 362 p. 107 illus.

Available Formats:

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.


(net) price for USA

ISBN 978-3-319-04657-0

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


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.


(net) price for USA

ISBN 978-3-319-04656-3

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

This book constitutes the revised selected papers of the 8th
International Workshop on Algorithms and Computation, WALCOM 2014, held in Chennai, India, in February 2014.
The 29 full papers presented together with 3 invited talks were
carefully reviewed and selected from 62 submissions. The papers are
organized in topical sections on computational geometry, algorithms and approximations, distributed computing and networks, graph algorithms, complexity and bounds, and graph embeddings and drawings.

Content Level » Research

Keywords » combinatorial optimization - data mining - nearest neighbor heuristic - recursion - sorting

Related subjects » Computational Science & Engineering - Image Processing - Theoretical Computer Science

Table of contents 

Computational Geometry.- Algorithms and Approximations.- Distributed Computing and Networks.- Graph Algorithms.- Complexity and Bounds.- Graph Embeddings and Drawings.

Popular Content within this publication 



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.