ENGLISH

Algorithms — ESA '97: 5th Annual European Symposium Graz, Austria, September 15–17, 1997 Proceedings

By Rainer Burkard , A. K. Amoura , E. Bampis , C. Kenyon , Y. Manoussakis (auth.) , Gerhard Woeginger (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1997
ISBN
3540633979, 9783540633976
DOI
10.1007/3-540-63397-9
LCC
QA76.9.A43 E83 1997
Open Library ID
OL667687M
Language
english
Format
DJVU
Filesize
5 MB (5623035 bytes)
Series
Lecture Notes in Computer Science 1284
Edition
1
Pages
524\526
Library
Kolxo3
DPI
300
Time added
2009-12-04 00:34:26
Algorithm Analysis and Problem Complexity; Compute

Description

This book constitutes the refereed proceedings of the 5th Annual International European Symposium on Algorithms, ESA'97, held in Graz, Austria, September 1997. The 38 revised full papers presented were selected from 112 submitted papers. The papers address a broad spectrum of theoretical and applicational aspects in algorithms theory and design. Among the topics covered are approximation algorithms, graph and network algorithms, combinatorial optimization, computational biology, computational mathematics, data compression, distributed computing, evolutionary algorithms, neural computing, online algorithms, parallel computing, pattern matching, and others.

Similar books