Pages that link to "Item:Q2795940"
From MaRDI portal
The following pages link to Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints (Q2795940):
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)
- On the 2-Center Problem Under Convex Polyhedral Distance Function (Q2958331) (← links)
- Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions (Q5919112) (← links)
