Algorithms - ESA’ 99

丛 书 名：Lecture Notes in Computer Science

版本说明：1

作     者：Jaroslav Nešetřil 

I S B N：(纸本) 9783540662518 

出 版 社：Springer Berlin  Heidelberg 

出 版 年：1000年

页      数：XIII, 559页

主 题 词：Programming Techniques Theory of Computation Data Structures and Information Theory Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Data Structures 

摘      要：The 7th Annual European Symposium on Algorithms (ESA ’99) is held in Prague, Czech Republic, July 16-18, 1999. This continued the tradition of the meetings which were held in – 1993 Bad Honnef (Germany) – 1994 Utrecht (Netherlands) – 1995 Corfu (Greece) – 1996 Barcelona (Spain) – 1997 Graz (Austria) – 1998 Venice (Italy) (The proceedingsof previousESA meetings were publishedas Springer LNCS v- umes 726, 855, 979, 1136, 1284, 1461.) In the short time of its history ESA (like its sister meeting SODA) has become a popular and respected meeting. The call for papers stated that the “Symposium covers research in the use, design, and analysis of ef?cient algorithms and data structures as it is carried out in c- puter science, discrete applied mathematics and mathematical programming. Papers are solicited describing original results in all areas of algorithmic research, including but not limited to: Approximation Algorithms; Combinatorial Optimization; Compu- tional Biology; Computational Geometry; Databases and Information Retrieval; Graph and Network Algorithms; Machine Learning; Number Theory and Computer Algebra; On-line Algorithms; Pattern Matching and Data Compression; Symbolic Computation.