'This is a very stimulating book!' - N. G. de Bruijn. 'This short book will provide extremely enjoyable reading to anyone with an interest in discrete mathematics and algorithm design' - ""Mathematical Reviews"". 'This book is an excellent (and enjoyable) means of sketching a large area of computer science for specialists in other fields: It requires little previous knowledge, but expects of the reader a degree of mathematical facility and a willingness to participate. It is really neither a survey nor an introduction; rather, it is a paradigm, a fairly complete treatment of a single example used as a synopsis of a larger subject' - ""SIGACT News"". 'Anyone would enjoy reading this book. If one had to learn French first, it would be worth the effort!' - ""Computing Reviews"". The above citations are taken from reviews of the initial French version of this text - a series of seven expository lectures that were given at the University of Montreal in November of 1975.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 is one of the most prominent figures of modern computer science. His works in ""The Art of Computer Programming"" are classic. He is also renowned for his development of TeX and METAFONT. In 1996, Knuth won the prestigious Kyoto Prize, considered to be the nearest equivalent to a Nobel Prize in computer science.
This book probes the stable marriage problem and its variants as a rich source of problems and ideas that illustrate both the design and analysis of efficient algorithms.
Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and c
... algorithms. 1 Introduction The field of property testing, originally introduced by Rubinfeld and Sudan [20], considers the following general problem: given a property P, determine the minimum ... Boolean Function Isomorphism Introduction.
... the preference profile, the number of people, and different topologies of the input graphs. The next avenue of defining a new problem is to study another variant of hard stable marriage problems and study them using appropriate ...
... the stable matching problem. Discrete Appl. Math. 11(3), 223–232 (1985) 6. Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algo- rithms. MIT Press, Boston (1989) 7. Irving, R.W.: Stable marriage and indifference ...
... The American Economic Review 98(3), 669–689 (2008) Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algo- rithms. MIT Press, Cambridge (1989) Knuth, D.E.: Stable Marriage and Its Relation to Other Combinatorial ...
This book constitutes the refereed proceedings of the 15th Annual European Symposium on Algorithms, ESA 2007, held in Eilat, Israel, in October 2007 in the context of the combined conference ALGO 2007.
The 37 revised full papers presented in this volume were carefully reviewed and selected from 98 submissions. The book also contains 10 invited talks, 5 of which are in full-paper length.
... the stable marriage problem with one-sided ties. Algorithmica 68(3), 758–775 (2014) [15] Knuth, D.: Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms. Amer. Math ...
... stable marriages. J. Comput. Syst. Sci. 45, 233–284 (1992) 7. Feder, T.: Network flow and 2-satisfiability ... its applications. Math. Oper. Res. 23(4), 874–891 (1998) Pareto Optimal Matchings in Many-to-Many Markets with Ties Katar ́ına ...