Algorithm Engineering_ Bridging the Gap Between Algorithm Theory and Practice [Muller-Hannemann & Schirra 2010-10-08].pdf

(3580 KB) Pobierz
Lecture Notes in Computer Science
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
5971
Editorial Board
David Hutchison
Lancaster University, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Alfred Kobsa
University of California, Irvine, CA, USA
Friedemann Mattern
ETH Zurich, Switzerland
John C. Mitchell
Stanford University, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
Oscar Nierstrasz
University of Bern, Switzerland
C. Pandu Rangan
Indian Institute of Technology, Madras, India
Bernhard Steffen
TU Dortmund University, Germany
Madhu Sudan
Microsoft Research, Cambridge, MA, USA
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbruecken, Germany
Matthias Müller-Hannemann
Stefan Schirra (Eds.)
Algorithm
Engineering
Bridging the Gap
between Algorithm Theory and Practice
13
Volume Editors
Matthias Müller-Hannemann
Martin-Luther-Universität Halle-Wittenberg, Institut für Informatik
Von-Seckendorff-Platz 1, 06120 Halle, Germany
E-mail: muellerh@informatik.uni-halle.de
Stefan Schirra
Otto-von-Guericke Universität Magdeburg, Fakultät für Informatik
Universitätsplatz 2, 39106 Magdeburg, Germany
E-mail: stschirr@ovgu.de
Library of Congress Control Number: 2010931447
CR Subject Classification (1998): F.2, D.2, G.1-2, G.4, E.1, I.3.5, I.6
LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues
ISSN
ISBN-10
ISBN-13
0302-9743
3-642-14865-4 Springer Berlin Heidelberg New York
978-3-642-14865-1 Springer Berlin Heidelberg New York
This work is subject to copyright. All rights are reserved, whether the whole or part of the material is
concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting,
reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication
or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965,
in its current version, and permission for use must always be obtained from Springer. Violations are liable
to prosecution under the German Copyright Law.
springer.com
© Springer-Verlag Berlin Heidelberg 2010
Printed in Germany
Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India
Printed on acid-free paper
06/3180
Preface
The systematic development of efficient algorithms has become a key technology
for all kinds of ambitious and innovative computer applications. With major
parts of algorithmic theory and algorithmic practice developing in different di-
rections since the 1970s a group of leading researchers in the field started about
15 years ago to coin the new paradigm “Algorithm Engineering”. Its major goal
is to bridge the gap between theory and practice.
This book is a collection of survey articles on different aspects of Algo-
rithm Engineering, written by participants of a GI-Dagstuhl seminar held during
September 3-8, 2006. Dorothea Wagner and Peter Sanders came up with the idea
for the seminar, and approached us to organize it. In general, the concept of the
GI-Dagstuhl seminars is to provide young researchers (mostly PhD students)
with the opportunity to be introduced into a new emerging field of computer
science. Based on a list of topics collected by the organizers, the participants pre-
pared overview lectures they presented and discussed with other participants at
the research seminar in Dagstuhl. Each contribution was elaborated afterwards
and carefully cross-reviewed by all participants.
Chapter 1 gives an introduction into the emerging field of Algorithm Engi-
neering and describes its main ingredients. It also serves as an overview for the
remaining chapters of the book.
The editing process took much longer than expected, partially due to the
fact that several aspects of Algorithm Engineering have never been written up
before, which gave rise to lengthy internal discussions. But for the major part
of the delay, the editors take their responsibility. Since the field of Algorithm
Engineering has developed rapidly since the seminar took place, we made an
effort to keep the contents up to date. Ideally, our book will be used as an
introduction to the field. Although it has not been written as a textbook, it may
well serve as accompanying material and as a reference in class.
As this book project now comes to an end, we are indebted to many people and
institutions. First of all, we would like to thank the Gesellschaft für Informatik
e.V. (GI) for their generous support of the GI-Dagstuhl seminar, funding the stay
of all participants at Schloss Dagstuhl. We thank the Schloss Dagstuhl Leibniz-
Zentrum für Informatik GmbH for their excellent workshop facilities and its
hospitality, which provided the basis for a successful seminar. Alfred Hofmann
and his team made it possible to smoothly publish this volume in the LNCS series
of Springer. Special thanks go to Annabell Berger, Holger Blaar, and Kathleen
Kletsch for their help in the editing process.
March 2010
Matthias Müller-Hannemann
Stefan Schirra
List of Contributors
Editors
Matthias Müller-Hannemann
Martin-Luther-Universität
Halle-Wittenberg
Institut für Informatik
Von-Seckendorff-Platz 1
06120 Halle, Germany
muellerh@informatik.uni-halle.de
Stefan Schirra
Otto-von-Guericke Universität
Magdeburg
Fakultät für Informatik
Universitätsplatz 2
39106 Magdeburg, Germany
stschirr@ovgu.de
Authors
Heiner Ackermann
Fraunhofer Institute for
Industrial Mathematics
Fraunhofer-Platz 1
67663 Kaiserslautern, Germany
heiner.ackermann@itwm.fraunhofer.de
Daniel Delling
Microsoft Research Silicon Valley
1065 La Avenida
Montain View, CA 94043, USA
dadellin@microsoft.com
Deepak Ajwani
Aarhus University
MADALGO - Center for Massive
Data Algorithmics
IT-parken, Aabogade 34
8200 Aarhus N, Denmark
ajwani@cs.au.dk
Roman Dementiev
Universität Karlsruhe (TH)
Department of Computer Science,
Algorithmics II
Am Fasanengarten 5
76131 Karlsruhe, Germany
dementiev@ira.uka.de
Markus Geyer
Universität Tübingen
Wilhelm-Schickard-Institut für
Informatik, Paralleles Rechnen
Sand 14
72076 Tübingen, Germany
geyer@informatik.uni-tuebingen.de
Eric Berberich
Max-Planck-Institut für Informatik
Algorithms and Complexity
Campus E1 4
66123 Saarbrücken, Germany
eric@mpi-inf.mpg.de

Plik z chomika:

Inne pliki z tego folderu:

Inne foldery tego chomika:

Zgłoś jeśli naruszono regulamin