Approximation Algorithms for the Class Cover Problem

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.40, Iss.3-4, 2004-03, pp. : 215-223

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 algorithms for the stochastic priority facility location problem

By Li Gaidi Wang Zhen Wu Chenchen

Optimization, Vol. 62, Iss. 7, 2013-07 ,pp. : 919-928

Taylor & Francis Ltd

Access to resources Recommend Favorite

Exact and approximation algorithms for a soft rectangle packing problem

By Fügenschuh Armin Junosza-Szaniawski Konstanty Lonc Zbigniew

Optimization, Vol. 63, Iss. 11, 2014-11 ,pp. : 1637-1663

Taylor & Francis Ltd

Access to resources Recommend Favorite

Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem

By Gaur D.R. Ibaraki T. Krishnamurti R.

Journal of Algorithms, Vol. 43, Iss. 1, 2002-04 ,pp. : 138-152

Academic Press

Access to resources Recommend Favorite

On greedy approximation algorithms for a class of two-stage stochastic assignment problems

By Karademir Serdar Kong Nan Prokopyev Oleg A.

Optimization Methods and Software, Vol. 29, Iss. 1, 2014-01 ,pp. : 42-67

Taylor & Francis Ltd

Access to resources Recommend Favorite

Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks

By Oliveira C. Pardalos P.

Cybernetics and Systems Analysis, Vol. 41, Iss. 6, 2005-11 ,pp. : 898-908

Springer Publishing Company

Access to resources Recommend Favorite