Given a set of unit-discs in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs? Rado conjectured
Peter Brass, Ferran Hurtado, Benjamin J. Lafrenier...
In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, the area covered by a directional antenna with parameters , ,
Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasivis...
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Local pattern mining algorithms generate sets of patterns, which are typically not directly useful and have to be further processed before actual application or interpretation. Ra...
Abstract. This paper introduces a new tabu search algorithm for a twodimensional (2D) Strip Packing Problem (2D-SPP). It integrates several key features: A direct representation of...