Algorithms - ESA '96: Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996. Proceedings
This book constitutes the refereed proceedings of the 4th European Symposium on Algorithms, ESA '96, held in Barcelona, Spain, in September 1996.
The book presents 40 revised full papers selected from 124 submissions; also are included extended abstracts of two invited presentations. The papers included cover all research areas on algorithms and their analysis as it is carried out in the fields of computer science, discrete applied and algorithmic mathematics, operations research, and all other areas of algorithms-oriented research, design and analysis.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Approximation Algorithms for Dynamic Storage Allocation
22 other sections not shown
algorithm analysis applied approximation assigned assume block bound called color completion components Computer connected consider constant construction contains corresponding cost cover cycle data structure defined definition deletion denote directed distance distribution edges elements extended factor Figure function give given graph improved input insertion intersection interval keys known labeling least Lemma length linear lower bound matching method minimal moves networks node Note O(log obstacles obtain operations optimal packets parallel partition path pattern performance permutation polygon position possible present probability problem Proceedings processors programming Proof prove random ratio reduction respectively restricted robot root running satisfies schedule Science segments sequence shortest simple solution solve sorting space step string subset takes Theorem tree vertex vertices weight