Concepts4
📚TheoryIntermediate
Approximation Algorithm Theory
Approximation algorithms deliver provably near-optimal solutions for NP-hard optimization problems within guaranteed factors.
#approximation algorithms#ptas#fptas+12
📚TheoryIntermediate
NP-Completeness
NP-completeness classifies decision problems that are both in NP and as hard as any problem in NP via polynomial-time reductions.
#np-complete#np-hard#polynomial-time reduction+12
⚙️AlgorithmIntermediate
Tree DP - Matching and Covering
Tree DP solves matching, vertex cover, and independent set on trees in linear time using small state transitions per node.
#tree dp#maximum matching#vertex cover+12
⚙️AlgorithmIntermediate
Bipartite Matching - Kuhn's Algorithm
Kuhn’s algorithm finds a maximum matching in a bipartite graph by repeatedly searching for augmenting paths using DFS.
#bipartite matching#kuhn algorithm#augmenting path+12