This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 473G: Combinatorial Algorithms, Fall 2005 Homework 5 Due Thursday, November 17, 2005, at midnight (because you really dont want homework due over Thanksgiving break) Name: Net ID: Alias: Name: Net ID: Alias: Name: Net ID: Alias: Name: Net ID: Alias: Homeworks may be done in teams of up to three people. Each team turns in just one solution; every member of a team gets the same grade. Neatly print your name(s), NetID(s), and the alias(es) you used for Homework 0 in the boxes above. Attach this sheet (or the equivalent information) to the top of your solution to problem 1. If you are an I2CS student, print (I2CS) next to your name. Teams that include both oncampus and I2CS students can have up to four members. Any team containing both oncampus and I2CS students automatically receives 3 points of extra credit. Problems labeled / are likely to require techniques from next weeks lectures on cuts, flows, and matchings. See also Chapter 7 in Kleinberg and Tardos, or Chapter 26 in CLRS. / 1. Suppose you are asked to construct the minimum spanning tree of a graph G , but you are not completely sure of the edge weights. Specifically, you have a conjectured weight w ( e ) for every edge e in the graph, but you also know that up to k of these conjectured weights are wrong. With the exception of one edge e whose true weight you know exactly, you dont know which edges are wrong, or even how theyre wrong; the true weights of those edges could be larger or smaller than the conjectured weights. Given this unreliable information, it is of courseor smaller than the conjectured weights....
View
Full
Document
This note was uploaded on 10/14/2011 for the course ECON 101 taught by Professor Smith during the Spring '11 term at West Virginia University Institute of Technology.
 Spring '11
 Smith

Click to edit the document details