On the hardness of the border length minimization problem on a rectangular array

DOI10.1142/S0129054110007751zbMATH Open1213.68335OpenAlexW2082329260MaRDI QIDQ3069747FDOQ3069747

Authors: Vamsi Krishna Kundeti, Sanguthevar Rajasekaran 

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

Recommendations

• Approximating Border Length for DNA Microarray Synthesis
• Hardness and approximation of the asynchronous border minimization problem (extended abstract)
• Hardness and approximation of the asynchronous border minimization problem
• scientific article; zbMATH DE number 1945183

zbMATH Keywords

combinatorial optimizationNP-hardnessborder length minimizationmicroarray fabrication optimization

Mathematics Subject Classification ID

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

Cites Work

• NP-completeness of the Hamming salesman problem

Cited In (4)

• Hardness and approximation of the asynchronous border minimization problem (extended abstract)
• Title not available (Why is that?)
• Hardness and approximation of the asynchronous border minimization problem
• Theoretical lower bound for border length minimization problem

This page was built for publication: On the hardness of the border length minimization problem on a rectangular array

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069747)