Pages that link to "Item:Q2486079"
From MaRDI portal
The following pages link to A simple linear algorithm for computing rectilinear 3-centers (Q2486079):
Displaying 7 items.
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
- Efficient algorithms for computing one or two discrete centers hitting a set of line segments (Q2424732) (← links)
- The \(p\)-center problem under locational uncertainty of demand points (Q2688470) (← links)
- Computing the Line-Constrained k-center in the Plane for Small k (Q2830071) (← links)
- Computing the Rectilinear Center of Uncertain Points in the Plane (Q4557735) (← links)
- New Algorithms for k-Center and Extensions (Q5505644) (← links)
