On the hardness of the border length minimization problem on a rectangular array (Q3069747)
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 the hardness of the border length minimization problem on a rectangular array |
scientific article; zbMATH DE number 5838924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of the border length minimization problem on a rectangular array |
scientific article; zbMATH DE number 5838924 |
Statements
ON THE HARDNESS OF THE BORDER LENGTH MINIMIZATION PROBLEM ON A RECTANGULAR ARRAY (English)
0 references
19 January 2011
0 references
combinatorial optimization
0 references
NP-hardness
0 references
border length minimization
0 references
microarray fabrication optimization
0 references
0.8334919214248657
0 references
0.8085037469863892
0 references
0.8069301247596741
0 references
0.7681111693382263
0 references
