Pages that link to "Item:Q5387796"
From MaRDI portal
The following pages link to The Parameterized Complexity of the Unique Coverage Problem (Q5387796):
Displaying 9 items.
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- On nonlinear multi-covering problems (Q511715) (← links)
- A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
- The parameterized complexity of unique coverage and its variants (Q2392923) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares (Q2904540) (← links)
- The Budgeted Unique Coverage Problem and Color-Coding (Q3392967) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)