Pages that link to "Item:Q4632168"
From MaRDI portal
The following pages link to Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function (Q4632168):
Displaying 3 items.
- An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms (Q1367876) (← links)
- A linear time deterministic algorithm to find a small subset that approximates the centroid (Q2380033) (← links)
- Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions (Q5919112) (← links)
