Pages that link to "Item:Q3188909"
From MaRDI portal
The following pages link to Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments (Q3188909):
Displaying 4 items.
- On the complexity of sets of free lines and line segments among balls in three dimensions (Q420577) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Approximability issues of guarding a set of segments (Q2855782) (← links)
- THE MINIMUM GUARDING TREE PROBLEM (Q5411806) (← links)