Stable Marriage and Its Relation to Other Combinatorial Problems

Bibliographic Details
Title: Stable Marriage and Its Relation to Other Combinatorial Problems
Description: The book uses the appealing theory of stable marriage to introduce and illustrate a variety of important concepts and techniques of computer science and mathematics: data structures, control structures, combinatorics, probability, analysis, algebra, and especially the analysis of algorithms. The presentation is elementary, and the topics are interesting to nonspecialists. The theory is quite beautiful and developing rapidly. Exercises with answers, an annotated bibliography, and research problems are included. The text would be appropriate as supplementary reading for undergraduate research seminars or courses in algorithmic analysis and for graduate courses in combinatorial algorithms, operations research, economics, or analysis of algorithms. Donald E. Knuth was the 1996 recipient of the prestigious Kyoto Prize in the Advanced Technology category for his tremendous contributions to the development of 20th-century computer sciences through both research and education. The Kyoto Prize is Japan's highest private award for lifetime achievement.
Authors: Donald E. Knuth
Resource Type: eBook.
Subjects: Marriage theorem--Data processing, Combinatorial analysis--Data processing
Categories: MATHEMATICS / General
Database: eBook Index
Description
ISBN:9780821806036
9781470439248