Homework 6 Optional Problems
Prove that in graphs with positive integer edge weights, the local search algorithm for the maximum cut problem is not guaranteed to converge in a polynomial number of iterations.
ANSWER: See How Easy Is Local Search.
You May Also Enjoy
Brave Girls Don’t Cry
About Kakenya Ntaiya, the CNN Hero who is empowering Maasai women in Kenya.
Subversion to Git Migration
Migrating from Subversion to Git.
What’s Wrong with Java Collections - part I
Shortcomings of the Java Collections Framework.
Spring Cloud Netflix Eureka - The Hidden Manual
Internal working of the Spring Cloud Eureka discovery service.
Comments