Introduction
In this chapter we outline success stories of Algorithm Engineering on three wellknown problems: Shortest paths, Steiner trees, and the construction of Voronoi diagrams. All these topics have real-world applications of particular importance, and therefore received a lot of attention by various research groups in the last decades.
This is a preview of subscription content, log in via an institution to check access.
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
Delling, D., Hoffmann, R., Kandyba, M., Schulze, A. (2010). Chapter 9. Case Studies. 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_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-14866-8_9
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)