𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Minimum Reload Cost Cycle Cover

✍ Scribed by Giulia Galbiati; Stefano Gualandi; Francesco Maffioli

Book ID
108120750
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
235 KB
Volume
36
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On minimum submodular cover with submodu
On minimum submodular cover with submodular cost
✍ Hongjie Du; Weili Wu; Wonjun Lee; Qinghai Liu; Zhao Zhang; Ding-Zhu Du πŸ“‚ Article πŸ“… 2010 πŸ› Springer US 🌐 English βš– 126 KB
Minimum covering with travel cost
Minimum covering with travel cost
✍ SΓ‘ndor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt πŸ“‚ Article πŸ“… 2010 πŸ› Springer US 🌐 English βš– 686 KB
Minimum cycle covers of graphs
Minimum cycle covers of graphs
✍ Fan, Genghua πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 145 KB πŸ‘ 1 views

Some new results on minimum cycle covers are proved. As a consequence, it is obtained that the edges of a bridgeless graph G can be covered by cycles of total length at most |E(G)| + 25 24 (|V (G)| -1), and at most |E(G)| + |V (G)| -1 if G contains no circuit of length 8 or 12.

Minimum cycle coverings and integer flow
Minimum cycle coverings and integer flows
✍ 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