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
Scala Curated
A curated list of Scala materials.
Python Curated
A curated list of Python materials.
System Design Curated
A Curated List of System Design Resources.
Online Algorithm Courses
A list of algorithm courses taught online and their exercise solutions.
Leave a comment