ON THE HARDNESS OF THE BORDER LENGTH MINIMIZATION PROBLEM ON A RECTANGULAR ARRAY

DOI10.1142/S0129054110007751zbMath1213.68335OpenAlexW2082329260MaRDI QIDQ3069747

Sanguthevar Rajasekaran, Vamsi Krishna Kundeti

Publication date: 19 January 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054110007751

zbMATH Keywords

combinatorial optimizationNP-hardnessborder length minimizationmicroarray fabrication optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Biochemistry, molecular biology (92C40)

Related Items (2)

Hardness and approximation of the asynchronous border minimization problem ⋮ Parameterized complexity of asynchronous border minimization

Cites Work

• NP-completeness of the Hamming salesman problem

This page was built for publication: ON THE HARDNESS OF THE BORDER LENGTH MINIMIZATION PROBLEM ON A RECTANGULAR ARRAY