Randomization methods in algorithm design : DIMACS workshop, December 12-14, 1997
Author(s)
Bibliographic Information
Randomization methods in algorithm design : DIMACS workshop, December 12-14, 1997
（DIMACS series in discrete mathematics and theoretical computer science, v. 43）
American Mathematical Society, c1999
Available at / 23 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
C-P||Princeton||1997.1298051454
-
No Libraries matched.
- Remove all filters.
Note
Workshop held at Princeton University
Includes bibliographical references
Description and Table of Contents
Description
This volume is based on proceedings held during the DIMACS workshop on Randomization Methods in Algorithm Design in December 1997 at Princeton. The workshop was part of the DIMACS Special Year on Discrete Probability. It served as an interdisciplinary research workshop that brought together a mix of leading theorists, algorithmists and practitioners working in the theory and implementation aspects of algorithms involving randomization. Randomization has played an important role in the design of both sequential and parallel algorithms. The last decade has witnessed tremendous growth in the area of randomized algorithms. During this period, randomized algorithms went from being a tool in computational number theory to finding widespread applications in many problem domains.Major topics covered include randomization techniques for linear and integer programming problems, randomization in the design of approximate algorithms for combinatorial problems, randomization in parallel and distributed algorithms, practical implementation of randomized algorithms, de-randomization issues, and pseudo-random generators. This volume focuses on theory and implementation aspects of algorithms involving randomization. It would be suitable as a graduate or advanced graduate text.
Table of Contents
Simple randomized Mergesort on parallel disks by R. D. Barve, E. F. Grove, and J. S. Vitter Randomized greedy algorithms for the hypergraph partitioning problem by R. Battiti, A. Bertossi, and R. Rizzi Elementary algebra revisited: Randomized algorithms by G. Cooperman and G. Havas Combinatorial property testing (a survey) by O. Goldreich Randomized and deterministic local search for SAT and scheduling problems by J. Gu An approximation scheme for scheduling of malleable parallel tasks by K. Jansen Blocking behaviors of broadcast switching networks in random traffics by D. S. Kim Greedy randomized adaptive search procedures for the Steiner problem in graphs by S. L. Martins, P. M. Pardalos, M. G. C. Resende, and C. C. Ribeiro On the mixing time of the triangulation walk and other Catalan structures by L. McShine and P. Tetali Bayesian approach for randomization of heuristic algorithms of discrete programming by J. Mockus, A. Mockus, and L. Mockus On the mixing rate of the triangulation walk by M. Molloy, B. Reed, and W. Steiger When and how $n$ choose $k$ by I. Pak Computing on optical models by S. Rajasekaran Manipulating statistical difference by A. Sahai and S. Vadhan A survey of the role of multicommodity flow and randomization in network design and routing by A. Srinivasan Some remarks on the optimal level of randomization in global optimization by T. V. Theodosopoulos.
by "Nielsen BookData"