AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms
About this Title
Donald E Knuth, Stanford University, Stanford, CA
Publication: CRM Proceedings and Lecture Notes
Publication Year:
1997; Volume 10
ISBNs: 978-0-8218-0603-6 (print); 978-1-4704-3924-8 (online)
DOI: https://doi.org/10.1090/crmp/010
MathSciNet review: MR1415126
MSC: Primary 68Q25; Secondary 68-02, 68R05
Table of Contents
Front/Back Matter
Chapters
- Lecture 1. Introduction, definitions, and examples
- Lecture 2. Existence of a stable matching: the fundamental algorithm
- Lecture 3. Principle of deferred decisions: coupon collecting
- Lecture 4. Theoretical developments: application to the shortest path
- Lecture 5. Searching a table by hashing; mean behavior of the fundamental algorithm
- Lecture 6. Implementing the fundamental algorithm
- Lecture 7. Research problems