𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Defining extremes and trimming by minimum covering sets

✍ Scribed by R.A. Maller

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
759 KB
Volume
35
Category
Article
ISSN
0304-4149

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extremal packing and covering sets
Extremal packing and covering sets
✍ Rajinder Jeet Hans πŸ“‚ Article πŸ“… 1967 πŸ› Springer Vienna 🌐 English βš– 440 KB
Graphs defined by coverings of a set
Graphs defined by coverings of a set
✍ R. K. Guy; E. C. Milner πŸ“‚ Article πŸ“… 1968 πŸ› Akadmiai Kiad 🌐 English βš– 703 KB
On minimum sets of 1-factors covering a
On minimum sets of 1-factors covering a complete multipartite graph
✍ David Cariolaro; Hung-Lin Fu πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 132 KB πŸ‘ 1 views

## Abstract We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1‐factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum size of such a set. Β© 2008 Wiley Periodicals, Inc. J Graph Theory 58:239‐250,

Parallel and serial heuristics for the m
Parallel and serial heuristics for the minimum set cover problem
✍ Sreejit Chakravarty; Ajay Shekhawat πŸ“‚ Article πŸ“… 1992 πŸ› Springer US 🌐 English βš– 695 KB

We present a theoretical analysis and an experimental evaluation of four serial heuristics and four parallel heuristics for the minimum set cover problem. The serial heuristics trade off run time with the quality of the solution. The parallel heuristics are derived from one of the serial heuristics.