Randomization Methods in Algorithm Design: Dimacs Workshop, December 12-14, 1997 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)

Rajasekaran, Sanguthevar

ISBN 10: 0821809164 / ISBN 13: 9780821809167

Published by Amer Mathematical Society, 1999

About this Item

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. Editor(s): Pardalos, Panos M.; Rolim, Jose D. P. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 318 pages. BIC Classification: PBK; PBT; PBWH. Category: (P) Professional & Vocational. Dimension: 230. Weight in Grams: 776. . 1998. Hardcover. . . . . Books ship from the US and Ireland.

Seller Inventory # V9780821809167

Bibliographic Details

• Title: Randomization Methods in Algorithm Design: Dimacs Workshop, December 12-14, 1997 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
• Publisher: Amer Mathematical Society
• Publication Date: 1999
• Language: English
• ISBN 10: 0821809164
• ISBN 13: 9780821809167
• Binding: Hardcover
• Condition: New

About this title

Synopsis

A collection of 16 refereed papers from the December 1997 workshop held at Princeton. The volume focuses on theory and implementation aspects of algorithms involving randomization. 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. Suitable as a graduate text. No index. Annotation c. by Book News, Inc., Portland, Or.