✦ LIBER ✦

A generalization of the classical occupancy problem

✍ Scribed by V.R.R Uppuluri; John A Carpenter

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 344 KB
Volume: 34
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(71)90115-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a generalization of the classical mom

On a generalization of the classical moment problem

✍ Konrad Schmüdgen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 537 KB

Optical switch dimensioning and the clas

Optical switch dimensioning and the classical occupancy problem

✍ Vincenzo Eramo; Marco Listanti; Carl Nuzman; Phil Whiting 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB

A generalization of the Oberwolfach prob

A generalization of the Oberwolfach problem

✍ S. I. El-Zanati; S. K. Tipnis; C. Vanden Eynden 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## Abstract Let __n__ > 1 be an integer and let __a__~2~,__a__~3~,…,__a__~__n__~ be nonnegative integers such that $\sum\_{i=2}^{n} a\_i=2^{n-1} - 1$. Then $K\_{2^n}$ can be factored into $a\_2 C\_{2^2}$‐factors, $a\_3 C\_{2^3}$‐factors,…,$a\_n C\_{2^n}$‐factors, plus a 1‐factor. © 2002 Wiley Perio

A New Generalization of the Classical Th

A New Generalization of the Classical Theorem of G. Szegö

✍ M. M. Djrbashian; N. V. Grigorian 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 519 KB

q-generalization of a ballot problem

✍ C. Krattenthaler; S.G. Mohanty 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 721 KB

n-dimensional lattice paths which do not touch the hyperplanes xi-xi + I = -1, i = 1,2, , n -1, and x,-x1 = -1 -K arc enumerated by certain statistics, one of which is MacMahon's major index, the others being variations of it. By a reflection-like proof, a formula involving determinants is obtained.

A generalization of the weighted set cov

A generalization of the weighted set covering problem

✍ Jian Yang; Joseph Y-T. Leung 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect __b__‐matching problem. In general,