This book investigates the theoretical underpinnings and practical applications of approximation algorithms and online algorithms. It presents research contributions from the 2007 Elat workshop, focusing on the design and analysis of algorithms that tackle computationally hard problems by providing near-optimal solutions or by making decisions in real-time with incomplete information.

The proceedings from the 2007 Elat workshop on Approximation and Online Algorithms are expected to offer a snapshot of current research in these specialized areas of theoretical computer science. The collection likely appeals to academic researchers and graduate students seeking to understand the state-of-the-art in algorithm design and analysis for problems where exact solutions are intractable or where decisions must be made sequentially. The focus on theoretical foundations suggests a dense, technical read aimed at specialists in the field.