Pages that link to "Item:Q2932520"

The following pages link to APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520):

Displayed 8 items.

• Efficient independent set approximation in unit disk graphs (Q2181244) ‎ (← links)
• Liar's dominating set problem on unit disk graphs (Q2201773) ‎ (← links)
• Liar’s Domination in 2D (Q2971650) ‎ (← links)
• Linear-Time Approximation Algorithms for Unit Disk Graphs (Q3453289) ‎ (← links)
• Minimum Dominating Set Problem for Unit Disks Revisited (Q3459050) ‎ (← links)
• Covering segments with unit squares (Q5894547) ‎ (← links)
• Vertex-edge domination in unit disk graphs (Q5918769) ‎ (← links)
• Algorithmic aspects of secure domination in unit disk graphs (Q6186318) ‎ (← links)