scientific article; zbMATH DE number 910876

MaRDI QIDQ4886050zbMATH OpenFDO

Authors Karen E. Daniels, Victor J. Milenkovic

Publication date 4 November 1996

zbMATH Keywords

translational containment problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Multiple translational containment. I: An approximate algorithm
• Multiple translational containment. II: Exact algorithms
• Approximation algorithms for multiple sequence alignment
• Approximation algorithms for the maximum multiple RNA interaction problem
• Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree
• Approximating the maximum multiple RNA interaction problem
• A fast algorithm for the constrained multiple sequence alignment problem
• scientific article; zbMATH DE number 2243049
• The containment condition and AdapFail algorithms
• Algorithms and Computation

Cited in

(9)

• scientific article; zbMATH DE number 1947380 (Why is no real title available?)
• Computing closely matching upper and lower bounds on textile nesting problems
• A heuristic algorithm for solving triangle packing problem
• The polygonal containment model
• A fully general, exact algorithm for nesting irregular shapes
• Multiple translational containment. I: An approximate algorithm
• Multiple translational containment. II: Exact algorithms
• A customized branch-and-bound approach for irregular shape nesting
• Column-based strip packing using ordered and compliant containment

This page was built for publication:

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