"
Skip to content
Topic:
Complexity of Graph Problems
Decision Problems and Input Encodings
Decision and Optimization Versions of Graph Problems
Certificates and Class NP
Approximation Ratios and Performance Guarantees
A Two-Approximation for Vertex Cover
A Randomized Half-Approximation for Maximum Cut
3-SAT as a Source Problem
3-Coloring With Variable and Clause Gadgets
newer
→