Pages that link to "Item:Q1816414"

The following pages link to A near-linear algorithm for the planar segment-center problem (Q1816414):

Displaying 19 items.

• Tight bounds on the maximum size of a set of permutations with bounded VC-dimension (Q439058) (← links)
• On solving the planar \(k\)-centrum problem with Euclidean distances (Q613427) (← links)
• Simple wriggling is hard unless you are a fat hippo (Q692941) (← links)
• Approximation algorithms for a \(k\)-line center (Q818652) (← links)
• Approximation algorithms for orthogonal line centers (Q831691) (← links)
• A near-linear algorithm for the planar 2-center problem (Q1364134) (← links)
• Continuous location of dimensional structures. (Q1410321) (← links)
• Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane (Q1752856) (← links)
• More planar two-center algorithms (Q1961384) (← links)
• Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
• A linear time deterministic algorithm to find a small subset that approximates the centroid (Q2380033) (← links)
• Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem (Q2412430) (← links)
• Efficient algorithms for computing one or two discrete centers hitting a set of line segments (Q2424732) (← links)
• A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
• On 0-1 matrices and small excluded submatrices (Q2566807) (← links)
• Computing a Segment Center for a Planar Point Set (Q3141535) (← links)
• (Q3404171) (← links)
• 1-Segment Center Problems (Q4024314) (← links)
• (Q5743461) (← links)