Approximating the Permanent via Importance Sampling with Application to the Dimer Covering Problem

Author： Beichl I.   Sullivan F.  

Publisher： Academic Press

ISSN： 0021-9991

Source： Journal of Computational Physics, Vol.149, Iss.1, 1999-02, pp. : 128-147

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

On the Hardness of Approximating the Min-Hack Problem

By Chinchani Ramkumar   Ha Duc   Iyer Anusha   Ngo Hung   Upadhyaya Shambhu  

Journal of Combinatorial Optimization, Vol. 9, Iss. 3, 2005-05 ,pp. : 295-311

Springer Publishing Company

Access to resources Recommend Favorite

Requiring Connectivity in the Set Covering Problem

By Cerdeira J.   Pinto Leonor  

Journal of Combinatorial Optimization, Vol. 9, Iss. 1, 2005-02 ,pp. : 35-47

Springer Publishing Company

Access to resources Recommend Favorite

A robust sensor covering and communication problem

By  

Naval Research Logistics: An International Journal, Vol. 62, Iss. 7, 2015-10 ,pp. : 582-594

John Wiley & Sons Inc

Access to resources Recommend Favorite

Approximating k -generalized connectivity via collapsing HSTs

By Segev Danny  

Journal of Combinatorial Optimization, Vol. 21, Iss. 3, 2011-04 ,pp. : 364-382

Springer Publishing Company

Access to resources Recommend Favorite

Approximating the 2-catalog segmentation problem using semidefinite programming relaxations

By Xu Dachuan   Ye Yinyu   Zhang Jiawei  

Optimization Methods and Software, Vol. 18, Iss. 6, 2003-12 ,pp. : 705-719

Taylor & Francis Ltd

Access to resources Recommend Favorite