Approximate Turing kernelization and lower bounds for domination problems (Q6926175)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8097211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate Turing kernelization and lower bounds for domination problems |
scientific article; zbMATH DE number 8097211 |
Statements
Approximate Turing kernelization and lower bounds for domination problems (English)
0 references
24 September 2025
0 references
approximate Turing kernelization
0 references
approximation lower bounds
0 references
exponential-time hypothesis
0 references
dominating set
0 references
capacitated dominating
0 references
connected dominating set
0 references
independent dominating set
0 references
treewidth
0 references
vertex cover number
0 references
