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
## 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
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.
## 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