Track this book
You choose which shelves are public. Progress and read dates stay yours.
About
"This volume brings together papers from various fields of theoretical computer science, including computational geometry, parallel algorithms, algorithms on graphs, data structures and complexity of algorithms. Some of the invited papers include surveys of results in particular fields and some report original research, while all the contributed papers report original research. Most of the algorithms given are for parallel models of computation. The papers were presented at the Second International Symposium on Optimal Algorithms held in Varna, Bulgaria, in May/June 1989. The volume will be…
More like this
Reviews
Rating integrity
HealthyCounted ratings come from accounts older than 7 days and were made on or after publication. Finished readers weigh ×1.0. Readers who have not finished yet weigh ×0.5. Did-not-finish ratings are shown but not counted.
Editions
1 edition- Other · English · 1989Springer-Verlag · 308 pages · 9780387518596
Approximation theoryMathematical optimizationCongressesComputational complexityAlgorithmusApproximation, Théorie de l'CongrèsOptimisation mathématique