On approximating four covering and packing problems (Q1021577): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2009.01.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1895166666 / rank | |||
Normal rank | |||
Revision as of 20:51, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On approximating four covering and packing problems |
scientific article |
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
