Theoretical Computer Science and General Issues

Algorithms – ESA 2013

21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings

Editors: Bodlaender, Hans L., Italiano, Giuseppe F. (Eds.)

  • Up-to-date results
  • Fast-track conference proceedings
  • State-of-the-art research
see more benefits

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-642-40450-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $143.00
price for USA
  • ISBN 978-3-642-40449-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

This book constitutes the refereed proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, held in Sophia Antipolis, France, in September 2013 in the context of the combined conference ALGO 2013. The 69 revised full papers presented were carefully reviewed and selected from 303 initial submissions: 53 out of 229 in track "Design and Analysis" and 16 out of 74 in track "Engineering and Applications". The papers in this book present original research in all areas of algorithmic research, including but not limited to: algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching; quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.

Table of contents (69 chapters)

  • The Online Replacement Path Problem

    Adjiashvili, David (et al.)

    Pages 1-12

  • Flip Distance between Triangulations of a Simple Polygon is NP-Complete

    Aichholzer, Oswin (et al.)

    Pages 13-24

  • Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures

    Ajwani, Deepak (et al.)

    Pages 25-36

  • Computing the Greedy Spanner in Linear Space

    Alewijnse, Sander P. A. (et al.)

    Pages 37-48

  • Friendship and Stable Matching

    Anshelevich, Elliot (et al.)

    Pages 49-60

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-642-40450-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $143.00
price for USA
  • ISBN 978-3-642-40449-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Algorithms – ESA 2013
Book Subtitle
21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings
Editors
  • Hans L. Bodlaender
  • Giuseppe F. Italiano
Series Title
Theoretical Computer Science and General Issues
Series Volume
8125
Copyright
2013
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-40450-4
DOI
10.1007/978-3-642-40450-4
Softcover ISBN
978-3-642-40449-8
Edition Number
1
Number of Pages
XVIII, 829
Number of Illustrations and Tables
134 b/w illustrations
Topics