Editors:
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1269)
Conference series link(s): RANDOM: International Workshop on Randomization and Approximation Techniques in Computer Science
Conference proceedings info: RANDOM 1997.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (18 papers)
-
Front Matter
-
Back Matter
About this book
The volume presents 14 thoroughly revised full papers selected from 37 submissions; also included are four invited contributions by leading researchers. The book focuses on algorithms and complexity aspects arising in the development of efficient randomized solutions to computationally difficult problems. The papers are organized in sections on approximation, randomness, algorithms, and complexity.
Bibliographic Information
Book Title: Randomization and Approximation Techniques in Computer Science
Book Subtitle: International Workshop RANDOM'97, Bologna, Italy, July 11-12, 1997 Proceedings
Editors: José Rolim
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-63248-4
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1997
Softcover ISBN: 978-3-540-63248-1Published: 25 June 1997
eBook ISBN: 978-3-540-69247-8Published: 02 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 236
Topics: Theory of Computation, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Calculus of Variations and Optimal Control; Optimization, Combinatorics, Probability and Statistics in Computer Science