{"title":"Discrete tomography with distinct rows: Relaxation","authors":"H. Sahakyan, L. Aslanyan","doi":"10.1109/CSITECHNOL.2017.8312153","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Computer Science and Information Technologies (CSIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSITECHNOL.2017.8312153","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
