✦ LIBER ✦

Asymptotic approximation with Kantorovich polynomial

✍ Scribed by Ulrich Abel

Publisher: Springer
Year: 1998
Tongue: English
Weight: 408 KB
Volume: 14
Category: Article
ISSN: 1573-8175
DOI: 10.1007/bf02836771

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Statistical approximation results for Ka

Statistical approximation results for Kantorovich-type operators involving some special polynomials

✍ M. Ali Özarslan; Oktay Duman; H.M. Srivastava 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 298 KB

Asymptotics of the Best Polynomial Appro

Asymptotics of the Best Polynomial Approximation of

✍ F. Nazarov; F. Peherstorfer; A. Volberg; P. Yuditskii 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 385 KB

An asymptotic fully polynomial time appr

An asymptotic fully polynomial time approximation scheme for bin covering

✍ Klaus Jansen; Roberto Solis-Oba 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 175 KB

In the bin covering problem there is a group L = (a1; : : : ; an) of items with sizes s(ai) ∈ (0; 1), and the goal is to ÿnd a packing of the items into bins to maximize the number of bins that receive items of total size at least 1. This is a dual problem to the classical bin packing problem. In th

Polynomial approximation with exponentia

Polynomial approximation with exponential weights

✍ Z. Ditzian; D. S. Lubinsky; P. Nevai; V. Totik 📂 Article 📅 1987 🏛 Akadmiai Kiad 🌐 English ⚖ 533 KB

Asymptotic approximation by polynomials

Asymptotic approximation by polynomials in the L1 norm

✍ J.H Freilich; P Rabinowitz 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Scheduling Malleable Parallel Tasks: An

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

✍ Klaus Jansen 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 230 KB