The problem of on-line bin packing restricted to instances with only two item sizes (known in advance) has a well-known lower bound of 4/3 for its asymptotic competitive ratio. We present an algorithm which shows that this lower bound is also an upper bound. Hence the asymptotic competitive ratio for this on-line problem is equal to 4/3. Our result extends the corresponding result of Faigle, Ke...

358 Ann Dermatol Received July 18, 2011, Revised August 9, 2011, Accepted for publication August 11, 2011 Corresponding author: Hakan Turan, M.D., Department of Dermatology, Duzce University Medical Faculty, Konuralp 81160 Duzce, Turkey. Tel: 90-380-542-13-90, Fax: 90-380-542-13-87, E-mail: drhakanturan@ gmail.com This is an Open Access article distributed under the terms of the Creative Common...

Let P (z) be a polynomial of degree n and M(P, t) = Max|z|=t |P (z)|. In this paper we shall estimate M(P ′ , ρ) in terms of M(P, r) where P (z) does not vanish in the disk |z| ≤ K, K ≥ 1, 0 ≤ r < ρ < K and obtain an interesting refinement of some result of Dewan and Malik. We shall also obtain an interesting generalization as well as a refinement of well-known result of P. Turan for polynomial...