APX-completeness
Description: A complexity-theoretic classification for optimization problems that are as hard to approximate as problems in APX under approximation-preserving reductions.
Primary topic: Advanced Graph Theory Research (42%)
OpenAlex ID: keywords/apx-completeness
