About these 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.
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
Springer Berlin Heidelberg 2011
Springer, Berlin, Heidelberg
Series Print ISSN
Series Online ISSN
Buy this book on publisher's site