On the parameterized complexity of the Maximum Exposure Problem. (English) Zbl 07647061
Summary: We investigate the parameterized complexity of the 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 in \(R\). The problem is known to be NP-hard. In this paper, we give fixed-parameter tractable results of MEP with respect to different parameterizations.
MSC:
| 68Qxx | Theory of computing |
References:
| [1] | Asadzadeh, P.; Kulik, L.; Tanin, E.; Wirth, A., On optimal arrangements of binary sensors, (International Conference on Spatial Information Theory (2011), Springer), 168-187 |
| [2] | de Berg, M.; van Kreveld, M.; Overmars, M.; Schwarzkopf, O., Computational Geometry: Algorithms and Applications (2000), Springer-Verlag · Zbl 0939.68134 |
| [3] | Bonnet, E.; Escoffier, B.; Paschos, V. T.; Tourniaire, E., Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization, Algorithmica, 71, 566-580 (2015) · Zbl 1312.68095 |
| [4] | Cai, L., Parameterized complexity of cardinality constrained optimization problems, Comput. J., 51 (2008) |
| [5] | Cygan, M.; Fomin, F. V.; Kowalik, Ł.; Lokshtanov, D.; Marx, D.; Pilipczuk, M.; Pilipczuk, M.; Saurabh, S., Parameterized Algorithms, vol. 3 (2015), Springer · Zbl 1334.90001 |
| [6] | Downey, R. G.; Fellows, M. R., Fundamentals of Parameterized Complexity, vol. 4 (2013), Springer · Zbl 1358.68006 |
| [7] | Kumar, N.; Sintos, S.; Suri, S., The maximum exposure problem, Comput. Geom., 104, Article 101861 pp. (2022) · Zbl 1483.68466 |
| [8] | Lokshtanov, D.; Saurabh, S.; Sharma, R.; Zehavi, M., Balanced judicious bipartition is fixed-parameter tractable, SIAM J. Discrete Math., 33, 1878-1911 (2019) · Zbl 1425.05129 |
| [9] | Niedermeier, R., Invitation to Fixed-Parameter Algorithms, vol. 31 (2006), OUP: OUP Oxford · Zbl 1095.68038 |
| [10] | Saurabh, S.; Zehavi, M., Parameterized complexity of multi-node hubs, J. Comput. Syst. Sci., 131, 64-85 (2023) · Zbl 1529.68225 |
| [11] | Shachnai, H.; Zehavi, M., Parameterized algorithms for graph partitioning problems, Theory Comput. Syst., 61, 721-738 (2017) · Zbl 1378.68094 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
