On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.8, Iss.4, 2004-12, pp. : 439-452

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

A p-cone sequential relaxation procedure for 0-1 integer programs

By Burer Samuel Chen Jieqiu

Optimization Methods and Software, Vol. 24, Iss. 4-5, 2009-08 ,pp. : 523-548

Taylor & Francis Ltd

Access to resources Recommend Favorite

Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa

By Ekim T.

International Journal of Computer Mathematics, Vol. 81, Iss. 5, 2004-05 ,pp. : 569-582

Taylor & Francis Ltd

Access to resources Recommend Favorite

Reoptimization of set covering problems

By Mikhailyuk V.

Cybernetics and Systems Analysis, Vol. 46, Iss. 6, 2010-11 ,pp. : 879-883

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

Approximate Set Covering in Uniform Hypergraphs

By Krivelevich M.

Journal of Algorithms, Vol. 25, Iss. 1, 1997-10 ,pp. : 118-143

Academic Press

Access to resources Recommend Favorite