Reconstructing binary matrices with timetabling constraints

DOI10.1016/j.jda.2016.07.001zbMath1355.68285OpenAlexW2479263369MaRDI QIDQ350725

Stefano Brocchi, Andrea Frosini, Srečko Brlek

Publication date: 9 December 2016

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2016.07.001

zbMATH Keywords

computational complexityreconstruction problemdiscrete tomographyscheduling problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Reconstruction of binary matrices under fixed size neighborhood constraints
• Complexity results for the horizontal bar packing problem
• Graph coloring with cardinality constraints on the neighborhoods
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Survey, categorization, and comparison of recent tour scheduling literature
• Project scheduling under limited resources. Models, methods, and applications
• A solvable case of image reconstruction in discrete tomography
• Using graphs for some discrete tomography problems
• Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography
• Solving the Two Color Problem: An Heuristic Algorithm
• Combinatorial Properties of Matrices of Zeros and Ones
• Reconstruction of binary matrices under adjacency constraints
• Symbolic timing devices
• Matroids and the greedy algorithm
• Handbook on Scheduling
• A THEOREM ON INDEPENDENCE RELATIONS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstructing binary matrices with timetabling constraints