Constant time approximation scheme for largest well predicted subset

Author： Fu Bin

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.25, Iss.3, 2013-04, pp. : 352-367

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

Makespan minimization in open shops: A polynomial time approximation scheme

By Sevastianov S.V. J. Woeginger G.

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 191-198

Elsevier

Access to resources Recommend Favorite

A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees

By Wu B.Y. Chao K-M. Tang C.Y.

Journal of Algorithms, Vol. 36, Iss. 2, 2000-08 ,pp. : 182-204

Academic Press

Access to resources Recommend Favorite

Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time

By Walsh T.R.

Journal of Algorithms, Vol. 29, Iss. 1, 1998-10 ,pp. : 165-173

Academic Press

Access to resources Recommend Favorite

Balanced double subset difference broadcast encryption scheme

SECURITY AND COMMUNICATION NETWORKS (ELECTRONIC), Vol. 8, Iss. 8, 2015-05 ,pp. : 1447-1460

John Wiley & Sons Inc

Access to resources Recommend Favorite

Optimal Constant in Approximation by Bernstein Operators

By P

Journal of Computational Analysis and Applications, Vol. 5, Iss. 2, 2003-04 ,pp. : 195-235

Springer Publishing Company

Access to resources Recommend Favorite