Explore cutting-edge approximation algorithms and online algorithms with this essential collection from WAOA 2004. Delve into the latest research in theoretical computer science, covering topics from competitive analysis and network design to scheduling and inapproximability results. This volume features revised selected papers and invited talks from a leading international workshop, offering deep insights for academics and researchers in algorithm design. A must-have resource for postgraduate students and professionals seeking to advance their knowledge in computational complexity and algorithmic solutions.