An asymptotic fully polynomial time approximation scheme for bin covering

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.306, Iss.1, 2003-09, pp. : 543-551

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

Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme

By Jansen Klaus

Algorithmica, Vol. 39, Iss. 1, 2004-01 ,pp. : 59-81

Springer Publishing Company

Access to resources Recommend Favorite

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

By Schuurman P. Woeginger G.J.

Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. : 105-122

Elsevier

Access to resources Recommend Favorite

A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology

By Xue Guoliang Xiao Wei

Algorithmica, Vol. 41, Iss. 1, 2004-10 ,pp. : 53-72

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial-Based Secret Image Sharing Scheme with Fully Lossless Recovery

International Journal of Digital Crime and Forensics (IJDCF), Vol. 10, Iss. 2, 2018-04 ,pp. : 120-136

IGI Global_journal

Access to resources Recommend Favorite

Combining polynomial running time and fast convergence for the disk-covering method

By Lagergren J.

Journal of Computer and System Sciences, Vol. 65, Iss. 3, 2002-11 ,pp. : 481-493

Academic Press

Access to resources Recommend Favorite