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. It covers the most recent structural and algorithmic work on stable matching problems, simplifies and unifies many earlier proofs, strengthens several earlier results, and presents new results and more efficient algorithms.
The authors develop the structure of the set of stable matchings...
Dan Gusfield is Professor of Computer Science at the University of California, Davis. He is the coauthor of The Stable Marriage Problem: Structure and Algorithms (MIT Press) and author of Algorithms on Strings, Trees, and Sequences.
"About this title" may belong to another edition of this title.
US$ 33.78 shipping from United Kingdom to U.S.A.
Destination, rates & speedsSeller: dsmbooks, Liverpool, United Kingdom
Hardcover. Condition: Acceptable. Acceptable. book. Seller Inventory # D7S9-1-M-0262071185-3
Quantity: 1 available