ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Information Processing Letters
Volume 97, Issue 1, 16 January 2006, Pages 31-35
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (83 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.ipl.2005.08.012    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2005 Elsevier B.V. All rights reserved.

On the hardness of approximating Max-Satisfy

Uriel FeigeCorresponding Author Contact Information, E-mail The Corresponding Author and Daniel ReichmanE-mail The Corresponding Author

The Weizmann Institute, Rehovot 76100, Israel

Accepted 29 August 2005. 
Communicated by F. Meyer auf der Heide. 
Available online 13 October 2005.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over View the MathML source. We prove that unless NPsubset ofBPP Max-Satisfy cannot be efficiently approximated within an approximation ratio of 1/n1−var epsilon, if we consider systems of n linear equations with at most n variables and var epsilon>0 is an arbitrarily small constant. Previously, it was known that the problem is NP-hard to approximate within a ratio of 1/nα, but 0<α<1 was some specific constant that could not be taken to be arbitrarily close to 1.

Keywords: Approximation algorithms; Computational complexity


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.