Basket

0585147 - ÚI 2025 RIV NL eng J - Journal Article
Acharyya, A. - Keikha, Vahideh - Majumdar, D. - Pandit, S.
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms.
Theoretical Computer Science. Roč. 990, 1 April 2024 (2024), č. článku 114402. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA ČR(CZ) GJ19-06792Y
Institutional support: RVO:67985807
Keywords : Constrained geometric hitting set * Computational complexity * Approximation algorithms * Parameterized complexity * Kernelization * Set cover conjecture
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 1.1, year: 2022
https://doi.org/10.1016/j.tcs.2024.114402
Permanent Link: https://hdl.handle.net/11104/0352882