d-散集的改进(In-)近似界

Q3 Mathematics

Journal of Graph Algorithms and Applications Pub Date : 2023-01-01 DOI:10.7155/jgaa.00621

Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos

{"title":"d-散集的改进(In-)近似界","authors":"Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos","doi":"10.7155/jgaa.00621","DOIUrl":null,"url":null,"abstract":"In the $d$-Scattered Set problem we are asked to select at least $k$ vertices of a given graph, so that the distance between any pair is at least $d$. We study the problem's (in-)approximability and offer improvements and extensions of known results for Independent Set, of which the problem is a generalization. ","PeriodicalId":35667,"journal":{"name":"Journal of Graph Algorithms and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Improved (In-)Approximability Bounds for d-Scattered Set\",\"authors\":\"Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos\",\"doi\":\"10.7155/jgaa.00621\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the $d$-Scattered Set problem we are asked to select at least $k$ vertices of a given graph, so that the distance between any pair is at least $d$. We study the problem's (in-)approximability and offer improvements and extensions of known results for Independent Set, of which the problem is a generalization. \",\"PeriodicalId\":35667,\"journal\":{\"name\":\"Journal of Graph Algorithms and Applications\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Algorithms and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7155/jgaa.00621\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7155/jgaa.00621","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 1

摘要

在$d$-Scattered Set问题中，我们被要求在给定的图中选择至少$k$个顶点，使得任意对之间的距离至少$d$。我们研究了问题的(in-)逼近性，并对独立集问题的已知结果进行了改进和扩展，其中独立集问题是一个泛化问题。

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

查看原文本刊更多论文

Improved (In-)Approximability Bounds for d-Scattered Set

In the $d$-Scattered Set problem we are asked to select at least $k$ vertices of a given graph, so that the distance between any pair is at least $d$. We study the problem's (in-)approximability and offer improvements and extensions of known results for Independent Set, of which the problem is a generalization.

求助全文

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

来源期刊

Journal of Graph Algorithms and Applications Mathematics-Geometry and Topology

CiteScore

1.20

自引率

0.00%

发文量

审稿时长

50 weeks

期刊介绍： The Journal of Graph Algorithms and Applications (JGAA) is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. JGAA is supported by distinguished advisory and editorial boards, has high scientific standards and is distributed in electronic form. JGAA is a gold open access journal that charges no author fees. Topics of interest for JGAA include but are not limited to: Design and analysis of graph algorithms: exact and approximation graph algorithms; centralized and distributed graph algorithms; static and dynamic graph algorithms; internal- and external-memory graph algorithms; sequential and parallel graph algorithms; deterministic and randomized graph algorithms. Experiences with graph and network algorithms: animations; experimentations; implementations. Applications of graph and network algorithms: biomedical informatics; computational biology; computational geometry; computer graphics; computer-aided design; computer and interconnection networks; constraint systems; databases; economic networks; graph drawing; graph embedding and layout; knowledge representation; multimedia; social networks; software engineering; telecommunication networks; user interfaces and visualization; VLSI circuits.