CS 246 Study Guide - Quiz Guide: Set Cover Problem, Bipartite Graph

• School: Stanford University
• Department: Computer Science
• Course: CS 246
• Professor: all

Document Summary

You can attempt to answer the questions as many times as you like. The score of the *last* submission gets saved into our records (that is, once you get a perfect score, don"t submit again with a bad one): this bipartite graph: Robert: home page, handouts, tutorials, homeworks, lab projects, reports, class administration, question bank, log out. As we form a collection, we say an element is covered if it is in at least one set of the collection. Note: in this problem, we shall represent sets by concatentating their elements, without brackets or commas. For example, {a,b} will be represented simply as ab. There are many greedy algorithms that could be used to pick a collection of sets that is close to as small as possible. Here are some that you will consider http://www. newgradiance. com/cru/servlet/cotc?command=previewhomework&sessionid=d7746f0485a7182af1486295a05aa5e4cb6a1f34&testid=880& 1/3. Gradiance online accelerated learning sets that is close to as small as possible. Here are some that you will consider in this problem.