The inapproximability of non-NP-hard optimization problems

Author： Cai L.   Juedes D.   Kanj I.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 553-571

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Approximation of some NP-hard optimization problems by finite machines, in probability

By Hong D.   Birget  

Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. : 323-339

Elsevier

Access to resources Recommend Favorite

Approximate solution of NP optimization problems

By Ausiello G.   Crescenzi P.   Protasi M.  

Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,pp. : 1-55

Elsevier

Access to resources Recommend Favorite

Faster exact solutions for some NP-hard problems

By Drori L.   Peleg D.  

Theoretical Computer Science, Vol. 287, Iss. 2, 2002-09 ,pp. : 473-499

Elsevier

Access to resources Recommend Favorite

Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents

By Nourani Y.   Andresen B.  

Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. : 51-68

Elsevier

Access to resources Recommend Favorite

Approximability of hard combinatorial optimization problems: an introduction

By Maffioli Francesco   Galbiati Giulia  

Annals of Operations Research, Vol. 96, Iss. 1-4, 2000-11 ,pp. : 221-236

Springer Publishing Company

Access to resources Recommend Favorite