Introduction
Efficient algorithms are central components of almost every computer application. Thus, they become increasingly important in all fields of economy, technology, science, and everyday life. Most prominent examples of fields where efficient algorithms play a decisive role are bioinformatics, information retrieval, communication networks, cryptography, geographic information systems, image processing, logistics, just to name a few.
Algorithmics—the systematic development of efficient algorithms—is therefore a key technology for all kinds of ambitious and innovative computer applications. Unfortunately, over the last decades there has been a growing gap between algorithm theory on one side and practical needs on the other. As a consequence, only a small fraction of the research done in Algorithmics is actually used. To understand the reasons for this gap, let us briefly explain how research in Algorithmics has been done traditionally.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Müller-Hannemann, M., Schirra, S. (2010). Chapter 1. Foundations of Algorithm Engineering. In: Müller-Hannemann, M., Schirra, S. (eds) Algorithm Engineering. Lecture Notes in Computer Science, vol 5971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14866-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-14866-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14865-1
Online ISBN: 978-3-642-14866-8
eBook Packages: Computer ScienceComputer Science (R0)