AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Randomization Methods in Algorithm Design
About this Title
Panos Pardalos, University of Florida, Gainesville, FL, Sanguthevar Rajasekaran, University of Florida, Gainesville, FL and José Rolim, University of Geneva, Geneva, Switzerland, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1999; Volume 43
ISBNs: 978-0-8218-0916-7 (print); 978-1-4704-4001-5 (online)
DOI: https://doi.org/10.1090/dimacs/043
MathSciNet review: MR1660775
MSC: Primary 68-06; Secondary 68Q25, 90-06
ReadershipTable of Contents
Front/Back Matter
Chapters
- Simple randomized Mergesort on parallel disks
- Randomized greedy algorithms for the hypergraph partitioning problem
- Elementary algebra revisited: Randomized algorithms
- Combinatorial property testing (a survey)
- Randomized and deterministic local search for SAT and scheduling problems
- An approximation scheme for scheduling of malleable parallel tasks
- Blocking behaviors of broadcast switching networks in random traffics
- Greedy randomized adaptive search procedures for the Steiner problem in graphs
- On the mixing time of the triangulation walk and other Catalan structures
- Bayesian approach for randomization of heuristic algorithms of discrete programming
- On the mixing rate of the triangulation walk
- When and how $n$ choose $k$
- Computing on optical models
- Manipulating statistical difference
- A survey of the role of multicommodity flow and randomization in network design and routing
- Some remarks on the optimal level of randomization in global optimization