TAILIEUCHUNG - Algorithms and Computation

Stable matching is one of the oldest problems studied from an algorithmic point of view, whose original version is defined as follows: An instance consists of N men, N women, and each person’s preference list. A preference list is a totally ordered list including all members of the opposite sex depending on his/her preference. For a matching M between men and women, a pair of a man m and a woman w is called a blocking pair if both prefer each other to their current partners. A matching with no blocking pair is called stable | Lecture Notes in Computer Science 4288 Commenced Publication in 1973 Founding and Former Series Editors Gerhard Goos Juris Hartmanis and Jan van Leeuwen Editorial Board David Hutchison Lancaster University UK Takeo Kanade Carnegie Mellon University Pittsburgh PA USA Josef Kittler University of Surrey Guildford UK Jon M. Kleinberg Cornell University Ithaca NY USA Friedemann Mattern ETH Zurich Switzerland John C. Mitchell Stanford University CA USA Moni Naor Weizmann Institute of Science Rehovot Israel Oscar Nierstrasz University of Bern Switzerland C. Pandu Rangan Indian Institute of Technology Madras India Bernhard Steffen University of Dortmund Germany Madhu Sudan Massachusetts Institute of Technology MA USA Demetri Terzopoulos University of California Los Angeles CA USA Doug Tygar University of California Berkeley CA USA Moshe Y. Vardi Rice University Houston TX USA Gerhard Weikum Max-Planck Institute of Computer Science Saarbruecken Germany Tetsuo Asano Ed. Algorithms and Computation 17th International Symposium ISAAC 2006 Kolkata India December 18-20 2006 Proceedings 1 Springer Volume Editor Tetsuo Asano JAIST Japan Advanced Institute of Science and Technology 1-1 Asahidai Nomi Ishikawa 923-1292 Japan E-mail t-asano@ Library of Congress Control Number 2006937541 CR Subject Classification 1998 LNCS Sublibrary SL 1 - Theoretical Computer Science and General Issues ISSN 0302-9743 ISBN-10 3-540-49694-7 Springer Berlin Heidelberg New York ISBN-13 978-3-540-49694-6 Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved whether the whole or part of the material is concerned specifically the rights of translation reprinting re-use of illustrations recitation broadcasting reproduction on microfilms or in any other way and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9 1965 in its .

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.