Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5760)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (28 chapters)
-
Computational Geometry and Geometric Graphs
-
Algorithm Engineering, Exactness, and Robustness
Keywords
About this book
This Festschrift volume, published in honor of Kurt Mehlhorn on the occasion of his 60th birthday, contains 28 papers written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Bob Constable.
The volume's title is a translation of the title of Kurt Mehlhorn's first book, "Effiziente Algorithmen", published by Teubner-Verlag in 1977. This Festschrift demonstrates how the field of algorithmics has developed and matured in the decades since then.
The papers included in this volume are organized in topical sections on models of computation and complexity; sorting and searching; combinatorial optimization with applications; computational geometry and geometric graphs; and algorithm engineering, exactness and robustness.
Editors and Affiliations
Bibliographic Information
Book Title: Efficient Algorithms
Book Subtitle: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
Editors: Susanne Albers, Helmut Alt, Stefan Näher
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-03456-5
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2009
Softcover ISBN: 978-3-642-03455-8Published: 28 August 2009
eBook ISBN: 978-3-642-03456-5Published: 01 September 2009
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: IX, 439
Topics: Programming Techniques, Mathematics of Computing, Discrete Mathematics, Algorithm Analysis and Problem Complexity, Math Applications in Computer Science, Numeric Computing