Overview
- fast track conference proceedings
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6552)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: WALCOM 2011.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (23 papers)
Other volumes
-
WALCOM: Algorithms and Computation
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
- algorithm analysis and problem complexity
About this book
Editors and Affiliations
Bibliographic Information
Book Title: WALCOM: Algorithms and Computation
Book Subtitle: 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011, Proceedings
Editors: Naoki Katoh, Amit Kumar
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-19094-0
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Berlin Heidelberg 2011
Softcover ISBN: 978-3-642-19093-3Published: 11 February 2011
eBook ISBN: 978-3-642-19094-0Published: 10 February 2011
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 233
Number of Illustrations: 37 b/w illustrations, 4 illustrations in colour
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Math Applications in Computer Science, Symbolic and Algebraic Manipulation, Computational Biology/Bioinformatics, Algorithms