具有不同行的离散断层扫描:松弛

2017 Computer Science and Information Technologies (CSIT) Pub Date : 2017-09-01 DOI:10.1109/CSITECHNOL.2017.8312153

H. Sahakyan, L. Aslanyan

{"title":"具有不同行的离散断层扫描:松弛","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":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"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\":\"13 1\",\"pages\":\"0\"},\"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}","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

摘要

本文考虑了一个离散层析问题，在此问题中引入了一个新的约束条件——行不同的要求。我们关注的是这个问题的一个宽松版本，其中允许有一定数量的重复行;研究了松弛问题的复杂性，并得到了几个性质/结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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 obtain several properties/results.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2017 Computer Science and Information Technologies (CSIT)

自引率

0.00%

发文量