Local search, reducibility and approximability of NP-optimization problems

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.


Download / Buy Article:

Keywords: Computational complexity; Optimization

Document Type: Research Article

DOI: http://dx.doi.org/10.1016/0020-0190(95)00006-X

Affiliations: Dipartimento di Matematica, Universita di Roma ''Tor Vergata'', via della Ricerca Scientifica, 00133 Roma, Italy

Publication date: April 28, 1995

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more