{"version":"1.0","type":"link","title":"APX - Newikis","description":"In computational complexity theory, the class APX (an abbreviation of \"approximable\") is the set of NP optimization problems that allow polynomial-time approximation algorithms with approximation ratio bounded by a constant (or constant-factor approximation algorithms for short). In simple terms,…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}