Independent Set
Input description: A graph G=(V,E), k
Problem description: Is there a subset S of V of size at least k such that no pair of vertices in S has an edge between them.
Example:
- Identifying location for a new franchise service such that no two locations are close enough to compete with each other.
- Highest capacity code for given communication channel.