CSE 331: Introduction to Algorithm Analysis and Design Fall 2011 Homework 1 Due Friday, September 16, 2009 by 1:15pm in class IMPORTANT: Please submit each problem separately, i.e. each problem should begin on a new page and only the pages for one problem should be stapled together. Failure to do so might result in some problem(s) not being graded. For general homework policies and our suggestions, please see the homework policy document. You can and will lose points if you do not follow the policies. For this homework, it might help if you read the the subsection “Extensions” in Section 1.1 of the textbook. 1. (20 + 20 = 40 points ) (a) Decide whether the following statement is true or false: In every Stable Marriage problem instance, there always exists a stable matching where for every matched pair ( m,w ), it is true that both m and w do not have the other as their least preferred partner. If you state true then you will have to formally argue why the statement is correct. If
This is the end of the preview. Sign up
access the rest of the document.
This note was uploaded on 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.