Košík

0585147 - ÚI 2025 RIV NL eng J - Článek v odborném periodiku
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
Grant CEP: GA ČR(CZ) GJ19-06792Y
Institucionální podpora: RVO:67985807
Klíčová slova: Constrained geometric hitting set * Computational complexity * Approximation algorithms * Parameterized complexity * Kernelization * Set cover conjecture
Impakt faktor: 1.1, rok: 2022
https://doi.org/10.1016/j.tcs.2024.114402
Trvalý link: https://hdl.handle.net/11104/0352882