相关论文: Analysis of the Harmonic Function Used in Bin-Pack…

In this paper we present the first algorithm with optimal average-case and close-to-best known worst-case performance for the classic on-line problem of bin packing. It has long been observed that known bin packing algorithms with optimal…

Bin covering is a dual version of classic bin packing. Thus, the goal is to cover as many bins as possible, where covering a bin means packing items of total size at least one in the bin. For online bin covering, competitive analysis fails…

We provide approximations to the prime counting function by various discretized versions of the logarithmic integral function, expressed solely in terms of the harmonic numbers. We demonstrate with explicit error bounds that these…

Numerically estimating the integral of functions in high dimensional spaces is a non-trivial task. A oft-encountered example is the calculation of the marginal likelihood in Bayesian inference, in a context where a sampling algorithm such…

We revisit the classic online bin packing problem. In this problem, items of positive sizes no larger than 1 are presented one by one to be packed into subsets called "bins" of total sizes no larger than 1, such that every item is assigned…

Bin packing is a classic optimization problem with a wide range of applications, from load balancing to supply chain management. In this work, we study the online variant of the problem, in which a sequence of items of various sizes must be…

It is proved that harmonic functions are characterized by harmonicity of their spherical means, for which purpose the iterated spherical means are used. The similar characterization of solutions to the modified Helmholtz equation…

The harmonic numbers and generalized harmonic numbers appear frequently in many diverse areas such as combinatorial problems, many expressions involving special functions in analytic number theory and analysis of algorithms. The aim of this…

Jamming in hard-particle packings has been the subject of considerable interest in recent years. In a paper by Torquato and Stillinger [J. Phys. Chem. B, 105 (2001)], a classification scheme of jammed packings into hierarchical categories…

We study the fault-tolerant variant of the online bin packing problem. Similar to the classic bin packing problem, an online sequence of items of various sizes should be packed into a minimum number of bins of uniform capacity. For…

We resurrect the infamous harmonic mean estimator for computing the marginal likelihood (Bayesian evidence) and solve its problematic large variance. The marginal likelihood is a key component of Bayesian model selection to evaluate model…

Some years ago, the harmonic polynomial was introduced in order to understand better the harmonic topological index; for instance, it allows to obtain bounds of the harmonic index of the main products of graphs. Here, we obtain several…

The article proposes a heuristic approximation approach to the bin packing problem under multiple objectives. In addition to the traditional objective of minimizing the number of bins, the heterogeneousness of the elements in each bin is…

We explore approximation algorithms for the $d$-dimensional geometric bin packing problem ($d$BP). Caprara (MOR 2008) gave a harmonic-based algorithm for $d$BP having an asymptotic approximation ratio (AAR) of $T_{\infty}^{d-1}$ (where…

We consider the problem of finding the best harmonic or analytic approximant to a given function. We discuss when the best approximant is unique, and what regularity properties the best approximant inherits from the original function. All…

The fractional q-calculus is the q-extension of the ordinary fractional calculus and dates back to early 20-th century. The theory of q-calculus operators are used in various areas of science such as ordinary fractional calculus, optimal…

Consistent Hashing functions are widely used for load balancing across a variety of applications. However, the original presentation and typical implementations of Consistent Hashing rely on randomised allocation of hash codes to keys which…

In 1994 J. Lewis obtained a purely harmonic proof of the classical Little Picard Theorem by showing that if the joint value distribution of two entire harmonic functions satisfies certain restrictions then they are necessarily constant. We…

Harmonic, Geometric, Arithmetic, Heronian and Contraharmonic means have been studied by many mathematicians. In 2003, H. Evens studied these means from geometrical point of view and established some of the inequalities between them in using…

The Bin Packing Problem is one of the most important optimization problems. In recent years, due to its NP-hard nature, several approximation algorithms have been presented. It is proved that the best algorithm for the Bin Packing Problem…