The following pages link to Max NP-completeness made easy (Q1960655):
Displaying 4 items.
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} (Q293272) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
