A priori optimization for the probabilistic maximum independent set problem

Author： Murat C.   Paschos V.T.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.270, Iss.1, 2002-01, pp. : 561-590

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

Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing

By Wocjan Pawel   Janzing Dominik   Beth Thomas  

Quantum Information Processing, Vol. 2, Iss. 4, 2003-08 ,pp. : 259-270

Springer Publishing Company

Access to resources Recommend Favorite

The Maximum Utilization Subtree Problem

By George J.W.  

Annals of Operations Research, Vol. 110, Iss. 1-4, 2002-02 ,pp. : 133-151

Springer Publishing Company

Access to resources Recommend Favorite

A Probabilistic Minimax Location Problem on the Plane

By Berman O.  

Annals of Operations Research, Vol. 122, Iss. 1-4, 2003-09 ,pp. : 59-70

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for the Set Covering Problem

By Caprara A.  

Annals of Operations Research, Vol. 98, Iss. 1-4, 2000-12 ,pp. : 353-371

Springer Publishing Company

Access to resources Recommend Favorite

On the disjunctive set problem

By Goralcik P.   Koubek V.  

Theoretical Computer Science, Vol. 204, Iss. 1, 1998-09 ,pp. : 99-118

Elsevier

Access to resources Recommend Favorite