𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A circle covering problem and DNA breakage

✍ Scribed by Lars Holst

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
295 KB
Volume
9
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A generalization of the weighted set cov
A generalization of the weighted set covering problem
✍ Jian Yang; Joseph Y-T. Leung πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 122 KB

## Abstract We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect __b__‐matching problem. In general,

Solution of a covering problem related t
Solution of a covering problem related to labelled tournaments
✍ Sgall, Ji?οΏ½ πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 462 KB πŸ‘ 2 views

Suppose we have a tournament with edges labelled so that the edges incident with any vertex have at most k distinct labels (and no vertex has outdegree 0). Let m be the minimal size of a subset of labels such that for any vertex there exists an outgoing edge labelled by one of the labels in the subs