Discrete tomography with distinct rows: Relaxation

In this paper we consider a discrete tomography problem, where a new constraint - the requirement of distinct rows is imposed. We focus on a relaxed version of the problem, where some constant number of repeated rows are allowed; and investigate the complexity of the relaxed problem, as well as obta...

Full description

Saved in:
Bibliographic Details
Published in2017 Computer Science and Information Technologies (CSIT) pp. 117 - 120
Main Authors Sahakyan, Hasmik, Aslanyan, Levon
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2017
Subjects
Automation
binary matrices
Complexity theory
different rows
Discrete tomography
Image reconstruction
Indexes
Informatics
relaxation
Search problems
Tomography
Online AccessGet full text

Cover

More Information
Summary:In this paper we consider a discrete tomography problem, where a new constraint - the requirement of distinct rows is imposed. We focus on a relaxed version of the problem, where some constant number of repeated rows are allowed; and investigate the complexity of the relaxed problem, as well as obtain several properties/results.
DOI:10.1109/CSITechnol.2017.8312153