Table of contents

  1. Front Matter
  2. Colin Cooper, Alan Frieze, Kurt Mehlhorn, Volker Priebe
    Pages 15-26
  3. Christos Levcopoulos, Joachim Gudmundsson
    Pages 27-41
  4. Prasad Tetali, Santosh Vempala
    Pages 57-66
  5. Andreas S. Schulz, Martin Skutella
    Pages 119-133
  6. Andris Ambainis, Rūsiņš Freivalds, Marek Karpinski
    Pages 175-185
  7. Jānis Kaņeps, Dainis Geidmanis, Rūsiņš Freivalds
    Pages 187-195
  8. Back Matter

About these proceedings

Introduction

This book constitutes the refereed proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'97, held as a satelite meeting of ICALP'97, in Bologna, Italy, in July 1997.
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.

Keywords

Approximation Algorithms Combinatorial Computation Complexity Computer Randomization Randomized Computation algorithm algorithms automata computer science modeling optimization

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-63248-4
  • Copyright Information Springer-Verlag 1997
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-63248-1
  • Online ISBN 978-3-540-69247-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Electronics
Telecommunications
Biotechnology