Pages that link to "Item:Q911284"
From MaRDI portal
The following pages link to An optimal approximation algorithm for the rectilinear m-center problem (Q911284):
Displaying 15 items.
- Bounded fan-out \(m\)-center problem (Q287146) (← links)
- Approximation algorithms for a \(k\)-line center (Q818652) (← links)
- Approximation algorithms for orthogonal line centers (Q831691) (← links)
- A note on the m-center problem with rectilinear distances (Q913636) (← links)
- A relaxation-based algorithm for solving the conditional \(p\)-center problem (Q974996) (← links)
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane (Q1752856) (← links)
- Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
- Parametric search: three new applications (Q2266831) (← links)
- A linear time deterministic algorithm to find a small subset that approximates the centroid (Q2380033) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- An efficient algorithm for the Euclidean \(r\)-centrum location problem (Q2570749) (← links)
- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p (Q3603555) (← links)
- On the rectangularp-center problem (Q4723543) (← links)
- A Polynomial Time Approximation Scheme for the Closest Shared Center Problem (Q4925254) (← links)
