𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering the Integers

✍ Scribed by B. Sury


Book ID
113094427
Publisher
Indian Academy of Sciences
Year
2012
Tongue
English
Weight
156 KB
Volume
17
Category
Article
ISSN
0971-8044

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On exact coverings of the integers
✍ John Friedlander πŸ“‚ Article πŸ“… 1972 πŸ› The Hebrew University Magnes Press 🌐 English βš– 204 KB
Integer flows and cycle covers
✍ Genghua Fan πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 561 KB
A cyclic integer covering problem
✍ GΓΆtz Uebe; Martin SchΓ€fer; Reinhold Kitta πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 421 KB
The multi-integer set cover and the faci
✍ 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

Minimal multiplicative covers of an inte
✍ Carl G. Wagner πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 633 KB

VfE[!. kj. 1 Ji+, Si#S)l have been studied Dreviously by Hcarnz and Wagner. The prrsent paper \*-eats three arrays. rG(n. k). 61(n. k). and k(n. k). which extend min. k i in the sense .:hat I ., PI --l R\*k)=~(p,...p,.k)=ri(p,.. -p,. k)= ni(s.k) for all sequences (r,. . . . \_p,l of distinct primes.

Minimum cycle coverings and integer flow
✍ Cun-Quan Zhang πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 421 KB

## Abstract It was conjectured by Fan that if a graph __G__ = (__V,E__) has a nowhere‐zero 3‐flow, then __G__ can be covered by two even subgraphs of total size at most |__V__| + |__E__| ‐ 3. This conjecture is proved in this paper. It is also proved in this paper that the optimum solution of the C