Pages that link to "Item:Q1737597"
From MaRDI portal
The following pages link to Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597):
Displaying 5 items.
- Corrigendum to: ``Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares'' (Q2285159) (← links)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
- Covering a set of line segments with a few squares (Q5925557) (← links)
- Covering a set of line segments with a few squares (Q5925680) (← links)
- Discrete and mixed two-center problems for line segments (Q6121433) (← links)
