http://www.cs.cmu.edu/~anupamg/adv-approx/
This material is based upon work supported by the National Science Foundation under Grant No. CCF-0747250. Any opinions, findings and conclusions or recomendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation (NSF).
Tuesday, January 29, 2008
Homework 2
Homework 2 is up on the course web page: I will also put a bunch of copies outside Nicole Stenger's office (Wean 4116) that you could pick up....
2 comments:
Anonymous
said...
In problem 3, I don't get what it means "move to any neighbor (R',B') with less cost." How is cost being defined here? Is cost just the number of edges that are not cut or is there a more general definition?
2 comments:
In problem 3, I don't get what it means "move to any neighbor (R',B') with less cost." How is cost being defined here? Is cost just the number of edges that are not cut or is there a more general definition?
Indeed, cost is just the number of edges that are not cut.
I guess I could have said: "move to any neighbor with a larger cut".
Post a Comment