Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (Q6201335): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2024.114402 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4391113039 / rank | |||
Normal rank | |||
Revision as of 09:54, 30 July 2024
scientific article; zbMATH DE number 7807470
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms |
scientific article; zbMATH DE number 7807470 |
Statements
Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (English)
0 references
20 February 2024
0 references
constrained geometric hitting set
0 references
computational complexity
0 references
approximation algorithms
0 references
parameterized complexity
0 references
kernelization
0 references
set cover conjecture
0 references
