Algorithms -- ESA 2010, Part II : 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings

Unbekannt

ISBN 10: 3642157807 / ISBN 13: 9783642157806

Published by Springer-Verlag GmbH, 2010

About this Item

Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Seller Inventory # 8647958/12

Bibliographic Details

• Title: Algorithms -- ESA 2010, Part II : 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings
• Publisher: Springer-Verlag GmbH
• Publication Date: 2010
• Language: English
• ISBN 10: 3642157807
• ISBN 13: 9783642157806
• Binding: Soft cover
• Condition: Sehr gut
• Seller catalogs:
  • Bücher

About this title

Synopsis

This volume contains the 69 papers presented at the 16th Annual European Symposium on Algorithms (ESA 2010), held in Liverpool during September 6–8, 2010, including three papers by the distinguished invited speakers Artur Czumaj, Herbert Edelsbrunner, and Paolo Ferragina. ESA 2010 was organized as a part of ALGO 2010, which also included the 10th Workshop on Algorithms in Bioinformatics (WABI), the 8th Workshop on Approximation and Online Algorithms (WAOA), and the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS). The European Symposium on Algorithms covers research in the design, use, andanalysisofe?cientalgorithmsanddata structures.As inpreviousyears,the symposium had two tracks: the Design and Analysis Track and the Engineering and Applications Track, each with its own Program Committee. In total 245 papers adhering to the submission guidelines were submitted. Each paper was reviewed by three or four referees. Based on the reviews and the often extensive electronicdiscussionsfollowingthem, thecommittees selected 66papersintotal: 56 (out of 206) to the Design and Analysis Track and 10 (out of 39) to the Engineering andApplicationstrack.We believethat thesepaperstogethermade up a strong and varied program, showing the depth and breadth of current algorithms research.