Pages that link to "Item:Q2181246"

The following pages link to Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints (Q2181246):

Displaying 2 items.

• Optimal algorithms for some intersection radius problems (Q1332347) (← links)
• 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)