Combinatorial Optimization in Pattern Assembly

DOI10.1007/978-3-642-39074-6_21MaRDI QIDQ5300928zbMATH OpenOpenAlexFDO

Authors Shinnosuke Seki

Publication date 28 June 2013

Published in Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39074-6_21

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• A polytope approach to the optimal assembly problem
• Publication:4729618
• A combinatorial approach to the problem of self-assembly
• scientific article; zbMATH DE number 3889242
• Polyhedral Combinatorics in Combinatorial Optimization
• Optimal array pattern synthesis using semidefinite programming
• Polyhedral combinatorics and combinatorial optimization
• Note: On the greedy algorithm for optimal assembly
• A combinatorial algorithm for the discrete optimization of structures

Cited in

(10)

• 3-color bounded patterned self-assembly
• An introduction to tile-based self-assembly and a survey of recent results
• Computing minimum tile sets to self-assemble color patterns
• Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
• Search methods for tile sets in patterned DNA self-assembly
• A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis
• 3-color bounded patterned self-assembly (extended abstract)
• Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
• Optimization for automated assembly of puzzles
• Constructing patterns of (many) ESSs under support size control

This page was built for publication: Combinatorial Optimization in Pattern Assembly

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