
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The proceedings includes 36 revised full papers presented together with 3 invited papers, addressing issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, amd more.
This volume presents the latest advancements in theoretical algorithmics from the 10th Scandinavian Workshop on Algorithm Theory. The proceedings compile 36 peer-reviewed full papers and 3 invited talks, covering a wide spectrum of algorithmic research. Topics range from fundamental areas like graph algorithms, computational geometry, and sorting to applied fields such as network algorithms, data storage, and optimization. The collection reflects the state-of-the-art in theoretical computer science and its diverse applications.
This collection of papers from SWAT 2006 offers a snapshot of the theoretical algorithmics landscape at the time. The inclusion of both submitted and invited papers suggests a comprehensive overview of current research trends and challenges. The breadth of topics indicates a significant contribution to the field, likely appealing to researchers and advanced students in computer science.
Page Count:
436
Publication Date:
2006-06-27
Publisher:
Springer Nature
ISBN-10:
3540357556
ISBN-13:
9783540357551
No comments yet. Be the first to share your thoughts!