61 search results - page 2 / 13 » On Packing Densities of Permutations |
DCG
2010
13 years 4 months ago
2010
We present the densest known packing of regular tetrahedra with density = 4000 4671 = 0.856347.... Like the recently discovered packings of Kallus et al. and Torquato
CORR
2010
Springer
13 years 4 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
ICCD
2001
IEEE
14 years 1 months ago
2001
IEEE
We propose two new instructions, swperm and sieve, that can be used to efficiently complete an arbitrary bit-level permutation of an n-bit word with or without repetitions. Permut...
COMBINATORICS
2007
13 years 4 months ago
2007
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
COMBINATORICS
2006
13 years 4 months ago
2006
Consider the symmetric group Sn equipped with the Hamming metric dH . Packing and covering problems in the finite metric space (Sn, dH ) are surveyed, including a combination of b...