International Journal of Computational Geometry & Applications最新文献

筛选

英文中文

Algorithms for Covering Barrier Points by Mobile Sensors with Line Constraint 移动传感器覆盖障碍点的线性约束算法

International Journal of Computational Geometry & Applications Pub Date : 2024-02-27 DOI: 10.1142/s0218195924500018

Princy Jain, Haitao Wang

{"title":"Algorithms for Covering Barrier Points by Mobile Sensors with Line Constraint","authors":"Princy Jain, Haitao Wang","doi":"10.1142/s0218195924500018","DOIUrl":"https://doi.org/10.1142/s0218195924500018","url":null,"abstract":"We study the problem of covering barrier points by mobile sensors. Each sensor is represented by a point in the plane with the same covering range [Formula: see text] so that any point within distance [Formula: see text] from the sensor can be covered by the sensor. Given a set [Formula: see text] of [Formula: see text] points (called “barrier points”) and a set [Formula: see text] of [Formula: see text] points (representing the “sensors”) in the plane, the problem is to move the sensors so that each barrier point is covered by at least one sensor and the maximum movement of all sensors is minimized. The problem is NP-hard. In this paper, we consider two line-constrained variations of the problem and present efficient algorithms that improve the previous work. In the first problem, all sensors are given on a line [Formula: see text] and are required to move on [Formula: see text] only while the barrier points can be anywhere in the plane. We propose an [Formula: see text] time algorithm for the problem. We also consider the weighted case where each sensor has a weight; we give an [Formula: see text] time algorithm for this case. In the second problem, all barrier points are on [Formula: see text] while all sensors are in the plane but are required to move onto [Formula: see text] to cover all barrier points. We also solve the weighted case in [Formula: see text] time.","PeriodicalId":269811,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":"12 5","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140426587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Maximum Bipartite Subgraphs of Geometric Intersection Graphs 几何交点图的最大双方子图

International Journal of Computational Geometry & Applications Pub Date : 2023-12-16 DOI: 10.1142/s021819592350005x

Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy

{"title":"Maximum Bipartite Subgraphs of Geometric Intersection Graphs","authors":"Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy","doi":"10.1142/s021819592350005x","DOIUrl":"https://doi.org/10.1142/s021819592350005x","url":null,"abstract":"We study the Maximum Bipartite Subgraph ([Formula: see text]) problem, which is defined as follows. Given a set [Formula: see text] of [Formula: see text] geometric objects in the plane, we want to compute a maximum-size subset [Formula: see text] such that the intersection graph of the objects in [Formula: see text] is bipartite. We first give an [Formula: see text]-time algorithm that computes an almost optimal solution for the problem on circular-arc graphs. We show that the [Formula: see text] problem is [Formula: see text]-hard on geometric graphs for which the maximum independent set is [Formula: see text]-hard (hence, it is [Formula: see text]-hard even on unit squares and unit disks). On the other hand, we give a [Formula: see text] for the problem on unit squares and unit disks. Moreover, we show fast approximation algorithms with small-constant factors for the problem on unit squares, unit disks, and unit-height axis parallel rectangles. Additionally, we prove that the Maximum Triangle-free Subgraph ([Formula: see text]) problem is NP-hard for axis-parallel rectangles. Here the objective is the same as that of the [Formula: see text] except the intersection graph induced by the set [Formula: see text] needs to be triangle-free only (instead of being bipartite).","PeriodicalId":269811,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":"53 24","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138995440","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Tiling the Plane with a Set of Ten Polyominoes 用一组10个多边形平铺平面

International Journal of Computational Geometry & Applications Pub Date : 2023-04-04 DOI: 10.1142/s0218195923500012

Chao Yang

引用次数: 0

International Journal of Computational Geometry &amp; Applications最新文献

International Journal of Computational Geometry & Applications最新文献