Synopsis
Explore the core ideas of probabilistic methods with practical algorithmic insight. This book presents how randomness and careful analysis drive fast, approximate solutions to hard problems, from packing and routing to flow optimization.
This edition emphasizes algorithmic aspects, showing how probabilistic tools translate into concrete procedures. It blends theory with applications, offering methods you can study and, in some cases, implement for challenging computational tasks.
- Accessible overviews of key concepts like randomized rounding and the Lovász Local Lemma
- Connections between probability, combinatorics, and concrete NP-hard problems
- Algorithmic techniques for balancing, flow shop problems, and related optimization tasks
- Historical context and references to foundational results in the field
Ideal for readers of theoretical computer science and discrete mathematics who want a seasoned view of how probability shapes algorithms and proofs.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
