✦ LIBER ✦

An extremal problem in the uniform covering of finite sets

✍ Scribed by Gustavus J Simmons

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 593 KB
Volume: 13
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(72)90025-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An adaptation of SH heuristic to the loc

An adaptation of SH heuristic to the location set covering problem

✍ Marcos Almiñana; Jesús T. Pastor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 555 KB

In a recent paper, a new surrogate heuristic (SH) has been proposed for the set covering problem. Here we present an adaptation of it in order to solve more efficiently the location set covering problem. We will show that our new version not only outperforms algorithm SH but that it is more accurate

On an extremal problem in the theory of

On an extremal problem in the theory of rational approximation

✍ D Khavinson; D Luecking 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Closed formulas for the numbers of small

Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees

✍ Charles Delorme; Odile Favaron; Dieter Rautenbach 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 192 KB

We derive closed formulas for the numbers of independent sets of size at most 4 and matchings of size at most 3 in graphs without small cycles that depend only on the degree sequence and the products of the degrees of adjacent vertices. As a related problem we describe an algorithm that determines

The number of extreme pairs of finite po

The number of extreme pairs of finite point-sets in Euclidean spaces

✍ Herbert Edelsbrunner; Gerd Stöckl 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 257 KB

An Extremal Problem in the Hypercube and

An Extremal Problem in the Hypercube and Optimization of Asynchronous Circuits

✍ Carlos Gustavo T. de A. Moreira; Pablo Emanuel 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 66 KB

We prove that if m ≥ 2, then the minimum k ∈ N such that the k-cube {0, 1} k can be decomposed as the disjoint union of m connected adjacent subsets satisfies 2 log 2 mlog 2 log 2 m -1 ≤ k ≤ 2 log 2 mlog 2 log 2 m + 5.

HLA serum screening based on an heuristi

HLA serum screening based on an heuristic solution of the set cover problem

✍ M.A Woodbury; E.A Ciftan; D.B Amos 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 496 KB

A computer program initially written by the Milwaukee Blood Bank has been modified to use a new algorithm for the assignment of HLA specificities to antisera. The assignment is based on the reactions of cells with known specificities. Specificities which are present only on cells which do not react