On approximating four covering and packing problems (Q1021577)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On approximating four covering and packing problems |
scientific article; zbMATH DE number 5562797
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On approximating four covering and packing problems |
scientific article; zbMATH DE number 5562797 |
Statements
On approximating four covering and packing problems (English)
0 references
8 June 2009
0 references
This article deals with application of covering and packing problems to biology. The focus is on the triangle packing, full sibling reconstruction, maximum profit coverage and 3-coverage. The authors's inapproximability constant improves the earlier results, while the results on full siblings reconstruction problem answer questions by Berge-Wolf et. al. A few other relevant problems of bioinformatics are discussed.
0 references
covering and packing problems
0 references
sibling reconstruction in wild population
0 references
triangle packing
0 references
approximation hardness
0 references
0 references
