ConceptAPX-hardness
APX-hard
A hardness concept in computational complexity theory indicating that a problem belongs to the APX class and is among the hardest problems in that class. If a problem is APX-hard, then unless P=NP it admits no polynomial-time approximation scheme (PTAS).
Timeline (last 90 days)
Nov 5
The capacitated cluster editing problem is NP-hard when there is no capacity constraint, and it has been proven to be APX-hard.
Unverified50%
Nov 5
APX-hard problems do not admit a polynomial-time approximation scheme (PTAS) unless P=NP.
Unverified50%