Structural properties of bounded relations with an application to NP optimization problems

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.250, Iss.1, 2001-01, pp. : 101-124

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

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

The inapproximability of non-NP-hard optimization problems

By Cai L. Juedes D. Kanj I.

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

Elsevier

Access to resources Recommend Favorite

Correlation Structure of Landscapes of NP-Complete Optimization Problems at Finite Temperatures

By Gehring Wolfgang Salamon Peter Whitney Roger E. Sibani Paolo

Open Systems and Information Dynamics, Vol. 11, Iss. 2, 2004-06 ,pp. : 177-184

Springer Publishing Company

Access to resources Recommend Favorite

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

Complete problems for monotone NP

By Stewart I.A.

Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. : 147-157

Elsevier

Access to resources Recommend Favorite