Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (Q6201335): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129595195, #quickstatements; #temporary_batch_1726329260436 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129595195 / rank | |||
Normal rank | |||
Revision as of 17:17, 14 September 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
0 references
0 references
