Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (Q6201335): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:13, 10 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
