Max NP-completeness Made Easy
نویسندگان
چکیده
We introduce a simple technique to obtain reductions between optimization constraint satisfaction problems. The technique uses the probabilistic method to reduce the size of disjunc-tions. As a rst application, we prove the Max NP-completeness of Max 3Sat without using the PCP theorem (thus solving an open question posed in Khanna et al. (1994)). Successively, we show that the \planar" restrictions of several optimization constraint satisfaction problems admit linear-time approximation schemes (thus improving the results of Khanna and Motwani (1996)).
منابع مشابه
An Alternative proof of SAT NP-Completeness
We give a proof of SAT’s NP-completeness based upon a syntaxic characterization of NP given by Fagin at 1974. Then, we illustrate a part of our proof by giving examples of how two well-known problems, MAX INDEPENDENT SET and 3COLORING, can be expressed in terms of CNF. Finally, in the same spirit we demonstrate the min NPO-completeness of MIN WSAT under strict reductions.
متن کاملDistinguish Hard Instances of an Np-hard Problem Using Machine Learning
Graph properties suitable for the classification of instance hardness for the NP-hard MAX-CUT problem are investigated. Eigenvalues of the adjacency matrix of a graph are demonstrated to be promising indicators of its hardness as a MAX-CUT instance.
متن کاملAn alternative proof of SAT NP-completeness (Preliminary version)
Nous donnons une preuve de la NP-complétude de SAT en se basant sur une caractérisation logique de la classe NP donnée par Fagin en 1974. Ensuite, nous illustrons une partie de la preuve en montrant comment deux problèmes bien connus, le problème de MAX STABLE et de 3-COLORATION peuvent s’exprimer sous forme conjonctive normale. Enfin, dans le même esprit, nous redémontrons la min NPOcomplétude...
متن کاملA Polynomial Time Algorithm for the Hamilton Circuit Problem
In this paper, we introduce a so-called ‘Multistage graph Simple Path’ (MSP) problem and show that the Hamilton Circuit (HC) problem can be polynomially reducible to the MSP problem. To solve the MSP problem, we propose a polynomial algorithm and prove its NP-completeness. Our result implies NP=P.
متن کاملMinimizing the Maximum End-to-End Network Delay: Hardness, Algorithm, and Performance
We study a flow problem where a source streams information to a sink over a directed graph G , (V,E) possibly using multiple paths to minimize the maximum end-to-end delay, denoted as Min-Max-Delay problem. Different from the maximum latency problem, our setting is unique in that communication over an edge incurs a constant delay within an associated capacity. We prove that Min-Max-Delay is wea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 225 شماره
صفحات -
تاریخ انتشار 1997