Remi Raman, S. ShahinJohnJ, R. Subashini, Subhasree Methirumangalath
{"title":"最大曝光问题的参数化复杂度","authors":"Remi Raman, S. ShahinJohnJ, R. Subashini, Subhasree Methirumangalath","doi":"10.48550/arXiv.2203.11114","DOIUrl":null,"url":null,"abstract":"We investigate the parameterized complexity of Maximum Exposure Problem (MEP). Given a range space (R, P ) where R is the set of ranges containing a set P of points, and an integer k, MEP asks for k ranges which on removal results in the maximum number of exposed points. A point p is said to be exposed when p is not contained in any of the ranges inR. The problem is known to be NP-hard. In this letter, we give fixed-parameter tractable results of MEP with respect to different parameterizations.","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Parameterized Complexity of the Maximum Exposure Problem\",\"authors\":\"Remi Raman, S. ShahinJohnJ, R. Subashini, Subhasree Methirumangalath\",\"doi\":\"10.48550/arXiv.2203.11114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the parameterized complexity of Maximum Exposure Problem (MEP). Given a range space (R, P ) where R is the set of ranges containing a set P of points, and an integer k, MEP asks for k ranges which on removal results in the maximum number of exposed points. A point p is said to be exposed when p is not contained in any of the ranges inR. The problem is known to be NP-hard. In this letter, we give fixed-parameter tractable results of MEP with respect to different parameterizations.\",\"PeriodicalId\":13545,\"journal\":{\"name\":\"Inf. Process. Lett.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Inf. Process. Lett.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2203.11114\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Inf. Process. Lett.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2203.11114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Parameterized Complexity of the Maximum Exposure Problem
We investigate the parameterized complexity of Maximum Exposure Problem (MEP). Given a range space (R, P ) where R is the set of ranges containing a set P of points, and an integer k, MEP asks for k ranges which on removal results in the maximum number of exposed points. A point p is said to be exposed when p is not contained in any of the ranges inR. The problem is known to be NP-hard. In this letter, we give fixed-parameter tractable results of MEP with respect to different parameterizations.