Pages that link to "Item:Q2203595"
From MaRDI portal
The following pages link to Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595):
Displaying 6 items.
- Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
