✦ LIBER ✦

A cyclic integer covering problem

✍ Scribed by Götz Uebe; Martin Schäfer; Reinhold Kitta

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 421 KB
Volume: 14
Category: Article
ISSN: 0895-7177
DOI: 10.1016/0895-7177(90)90343-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a problem of cyclic permutations of i

On a problem of cyclic permutations of integers

✍ Roberto Dvornicich 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 310 KB

A covering problem

✍ R. G. Notkin 📂 Article 📅 1971 🏛 Springer US 🌐 English ⚖ 519 KB

A polynomial algorithm for integer progr

A polynomial algorithm for integer programming covering problems satisfying the integer round-up property

✍ James B. Orlin 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 196 KB

The multi-integer set cover and the faci

The multi-integer set cover and the facility terminal cover problem

✍ Dorit S. Hochbaum; Asaf Levin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

## Abstract The facility terminal cover problem is a generalization of the vertex cover problem. The problem is to “cover” the edges of an undirected graph __G__ = (__V__,__E__) where each edge __e__ is associated with a non‐negative demand __d__~__e__~. An edge __e__ = __u__,__v__ is covered if at

A Covering Problem for Tori

✍ PatricR.J. Östergård; Taneli Riihonen 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 171 KB

A covering problem over finite rings

✍ I.N. Nakaoka; O.J.N.T.N. dos Santos 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Given a finite commutative ring with identity A, define c(A, n, R) as the minimum cardinality of a subset H of A n which satisfies the following property: every element in A n differs in at most R coordinates from a multiple of an element in H. In this work, we determine the numbers c(Z m , n, 0) fo