skip to main content

Title: Improved non-approximability results

We indicate strong non-approximability factors for central problems: N{sup 1/4} for Max Clique; N{sup 1/10} for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a proof system in which the verifier examines only three {open_quotes}free bits{close_quotes} to attain an error of 1/2. Underlying the Chromatic Number result is a reduction from Max Clique which is more efficient than previous ones.
Authors:
;
Publication Date:
OSTI Identifier:
35820
Report Number(s):
CONF-9408161-
TRN: 94:009753-0078
Resource Type:
Conference
Resource Relation:
Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.
Publisher:
Univ. of Michigan, Ann Arbor, MI (United States)
Country of Publication:
United States
Language:
English
Subject:
99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; NUMERICAL SOLUTION; EFFICIENCY; VARIATIONAL METHODS; MATRICES; LEAST SQUARE FIT