Open Problems

Related lectures (30)

Page 1 of 3

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Explores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.

Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.

Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Covers the theory and applications of graph coloring, focusing on disassortative stochastic block models and planted coloring.

Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.

Focuses on open problems and the importance of reformulating problems with better tools and intuition.