Amazon cover image
Image from Amazon.com
Image from Google Jackets

Algorithms – ESA 2011 [electronic resource] : 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings / edited by Camil Demetrescu, Magnús M. Halldórsson.

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 6942Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: XIX, 813 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783642237195
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 005.1 23
LOC classification:
  • QA76.9.A43
Online resources: In: Springer eBooksSummary: This book constitutes the refereed proceedings of the 19th Annual European Symposium on Algorithms, ESA 2011, held in Saarbrücken, Germany, in September 2011 in the context of the combined conference ALGO 2011. The 67 revised full papers presented were carefully reviewed and selected from 255 initial submissions: 55 out of 209 in track design and analysis and 12 out of 46 in track engineering and applications. The papers are organized in topical sections on approximation algorithms, computational geometry, game theory, graph algorithms, stable matchings and auctions, optimization, online algorithms, exponential-time algorithms, parameterized algorithms, scheduling, data structures, graphs and games, distributed computing and networking, strings and sorting, as well as local search and set systems.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified URL Status Date due Barcode
IMSc Library Link to resource Available EBK9875

This book constitutes the refereed proceedings of the 19th Annual European Symposium on Algorithms, ESA 2011, held in Saarbrücken, Germany, in September 2011 in the context of the combined conference ALGO 2011. The 67 revised full papers presented were carefully reviewed and selected from 255 initial submissions: 55 out of 209 in track design and analysis and 12 out of 46 in track engineering and applications. The papers are organized in topical sections on approximation algorithms, computational geometry, game theory, graph algorithms, stable matchings and auctions, optimization, online algorithms, exponential-time algorithms, parameterized algorithms, scheduling, data structures, graphs and games, distributed computing and networking, strings and sorting, as well as local search and set systems.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India