Complexity results for the horizontal bar packing problem

DOI10.1016/j.ipl.2008.07.007zbMath1191.68352OpenAlexW1976682037MaRDI QIDQ975490

Fethi Jarray, Christophe Picouleau, Marie-Christine Costa

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.07.007

zbMATH Keywords

algorithmscomputational complexitydiscrete tomographybar packingreconstructing problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Reconstructing binary matrices with timetabling constraints

Cites Work

• Reconstructing convex polyominoes from horizontal and vertical projections
• An acyclic days-off scheduling problem
• Tiling with bars under tomographic constraints.
• Discrete tomography. Foundations, algorithms, and applications
• Solving problems of discrete tomography application in workforce scheduling
• Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
• Combinatorial Properties of Matrices of Zeros and Ones
• Reconstruction of domino tiling from its two orthogonal projections

This page was built for publication: Complexity results for the horizontal bar packing problem