ENGLISH

Computing and Combinatorics: 7th Annual International Conference, COCOON 2001 Guilin, China, August 20–23, 2001 Proceedings

By Markus Bläser (auth.) , Jie Wang (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2001
ISBN
978-3-540-42494-9, 978-3-540-44679-8, 3-540-42494-6
DOI
10.1007/3-540-44679-6
Language
english
Format
PDF
Filesize
5 MB (5655195 bytes)
Series
Lecture Notes in Computer Science 2108
Edition
1
Pages
606\613
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

This book constitutes the refereed proceedings of the 7th Annual International Conference on Computing and Combinatorics, COCOON 2001, held in Guilin, China, in August 2001. The 50 revised full papers and 16 short papers presented were carefully reviewed and selected from 97 submissions. The papers are organized in topical sections on complexity theory, computational biology, computational geometry, data structures and algorithms, games and combinatorics, graph algorithms and complexity, graph drawing, graph theory, online algorithms, randomized and average-case algorithms, Steiner trees, systems algorithms and modeling, and computability.

Similar books