Home > Mathematics and Science Textbooks > Mathematics > Calculus and mathematical analysis > Randomization Methods in Algorithm Design: (Series in Discrete Mathematics & Theoretical Computer Science)
33%
Randomization Methods in Algorithm Design: (Series in Discrete Mathematics & Theoretical Computer Science)

Randomization Methods in Algorithm Design: (Series in Discrete Mathematics & Theoretical Computer Science)

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

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.


Best Sellers


Product Details
  • ISBN-13: 9780821809167
  • Publisher: American Mathematical Society
  • Publisher Imprint: American Mathematical Society
  • Language: English
  • Returnable: Y
  • Weight: 776 gr
  • ISBN-10: 0821809164
  • Publisher Date: 01 Jan 1999
  • Binding: Hardback
  • No of Pages: 318
  • Series Title: Series in Discrete Mathematics & Theoretical Computer Science


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Randomization Methods in Algorithm Design: (Series in Discrete Mathematics & Theoretical Computer Science)
American Mathematical Society -
Randomization Methods in Algorithm Design: (Series in Discrete Mathematics & Theoretical Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Randomization Methods in Algorithm Design: (Series in Discrete Mathematics & Theoretical Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA