Skip to main content
Conference Proceedings

Chapter 9. Case studies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 5971 LNCS 389-445
DOI: 10.1007/978-3-642-14866-8_9
1Citations
Citations of this article
39Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Delling, D., Hoffmann, R., Kandyba, M., & Schulze, A. (2010). Chapter 9. Case studies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5971 LNCS, pp. 389–445). https://doi.org/10.1007/978-3-642-14866-8_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free