Pages that link to "Item:Q2392923"

The following pages link to The parameterized complexity of unique coverage and its variants (Q2392923):

Displaying 10 items.

• On nonlinear multi-covering problems (Q511715) (← links)
• Minimum ply covering of points with disks and squares (Q827338) (← links)
• A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
• Exact multi-covering problems with geometric sets (Q2075389) (← links)
• A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
• A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
• Unique Covering Problems with Geometric Sets (Q3196414) (← links)
• The Budgeted Unique Coverage Problem and Color-Coding (Q3392967) (← links)
• Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (Q5745127) (← links)
• Local search strikes again: PTAS for variants of geometric covering and packing (Q5919362) (← links)