 |
|
|
Item Details
| Title:
|
RANDOMIZATION METHODS IN ALGORITHM DESIGN
|
| By: |
Sanguthevar Rajasekaran, Panos M. Pardalos (Editor), Jose D. P. Rolim (Editor) |
| Format: |
Hardback |
| List price:
|
£88.00 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
0821809164 |
| ISBN 13: |
9780821809167 |
| Publisher: |
AMERICAN MATHEMATICAL SOCIETY |
| Pub. date: |
15 October, 1998 |
| Series: |
Series in Discrete Mathematics & Theoretical Computer Science No. 43 |
| Pages: |
318 |
| Description: |
Focuses on theory and implementation aspects of algorithms involving randomization. This work covers topics including randomization techniques for linear and integer programming problems, randomization in the design of approximate algorithms for combinatorial problems and randomization in parallel and distributed algorithms. |
| Synopsis: |
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. |
| Publication: |
US |
| Imprint: |
American Mathematical Society |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|