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.
oai:noad.sci.am:135781
Institute for Informatics and Automation Problems
11th International Conference on Computer Science and Information Technologies CSIT 2017
Mar 3, 2021
Jul 15, 2020
20
https://noad.sci.am/publication/149308
Edition name | Date |
---|---|
Hasmik Sahakyan, Discrete Tomography with Distinct Rows: Relaxation | Mar 3, 2021 |
Sahakyan Hasmik Ryazanov Vladimir Margaryan Ani
Sahakyan Hasmik Margaryan Ani
Sahakyan Hasmik Aslanyan Levon
Sahakyan Hasmik Aslanyan Levon Ryazanov Vladimir