Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Algorithms –- ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12,

Algorithms –- ESA 2012

20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings

Epstein, Leah, Ferragina, Paolo (Eds.)

2012, XX, 839 p. 147 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 

ISBN 978-3-642-33090-2

digitally watermarked, no DRM

The eBook version of this title will be available soon


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$143.00

(net) price for USA

ISBN 978-3-642-33089-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Up to date results
  • Fast track conference proceedings
  • State of the art research
This book constitutes the refereed proceedings of the 20th Annual European Symposium on Algorithms, ESA 2012, held in Ljubljana, Slovenia, in September 2012 in the context of the combined conference ALGO 2012. The 69 revised full papers presented were carefully reviewed and selected from 285 initial submissions: 56 out of 231 in track design and analysis and 13 out of 54 in track engineering and applications. The papers are organized in topical sections such as 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.

Content Level » Research

Keywords » anonymous network - linear programming - network design - online algorithms - symmetric multicast

Related subjects » Communication Networks - Image Processing - Theoretical Computer Science

Table of contents 

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.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.