Year: 1990
Type: conference-paper
Abstract: We investigate tile relationship between logical expressibility of NP optimization problems and their approximation properties.First sucll attempt was made by Papadimitriou and Yannakakis, who defined the class of NPO problems MAX NP.We show that many importaut optimization problems do not belong to MAX NP and that in fact there are problems in P which are not ill lk'IAX NP.The problems that we consider fit naturally in a new complexity class that we call MAX Ill.We prove that several natural optimization problems are complete for MAX H1 under approxima.tionpreserving reductions.All these complete problems are non approximable unless P ¢ NP.This motivates the definition of subclasses of MAX II1 that only contain problems which are presumably easier with respect to approximation.In particular, the class that we call RMAX(2), contains approximable problems and prob-]elllS like MAX CLIQUE that are not known to be nonapproximable.We prove that MAX CLIQUE and several other optimization problems are complete for RMAX(2).
Authors: A. Panconesi, D. Ranjan
Institution: Cornell University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder: National Science Foundation
OpenAlex ID: W2015092796