Pages that link to "Item:Q1364134"

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

Displaying 42 items.

• Efficiently approximating color-spanning balls (Q284593) (← links)
• Streaming with minimum space: an algorithm for covering by two congruent balls (Q393049) (← links)
• Base station placement on boundary of a convex polygon (Q436692) (← links)
• Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
• A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
• On solving the planar \(k\)-centrum problem with Euclidean distances (Q613427) (← links)
• Improved algorithms for the bichromatic two-center problem for pairs of points (Q824325) (← links)
• The discrete 2-center problem (Q1272957) (← links)
• Pose estimation and object identification using complex algebraic representations (Q1273873) (← links)
• A sweepline algorithm to solve the two-center problem (Q1318733) (← links)
• A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center (Q1405006) (← links)
• The mixed center location problem (Q1631666) (← links)
• Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
• Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane (Q1752856) (← links)
• The 2-center problem in three dimensions (Q1947989) (← links)
• More planar two-center algorithms (Q1961384) (← links)
• On the planar two-center problem and circular hulls (Q2105328) (← links)
• An efficient algorithm for the proximity connected two center problem (Q2169955) (← links)
• Efficient planar two-center algorithms (Q2230394) (← links)
• Parametric search: three new applications (Q2266831) (← links)
• Minimum perimeter-sum partitions in the plane (Q2291459) (← 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)
• The discrete and mixed minimax 2-center problems (Q2424880) (← links)
• A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
• The two-center problem of uncertain points on a real line (Q2687919) (← links)
• Obnoxious facility location: complete service with minimal harm (Q2708039) (← links)
• (Q2708487) (← links)
• Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs (Q2944488) (← links)
• The Mixed Center Location Problem (Q2958327) (← links)
• Computing a Segment Center for a Planar Point Set (Q3141535) (← links)
• (Q3404171) (← links)
• A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM (Q3430335) (← links)
• The Discrete and Mixed Minimax 2-Center Problem (Q3467837) (← links)
• BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES (Q3520427) (← links)
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION (Q3526982) (← links)
• COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET (Q4513242) (← links)
• Covering convex polygons by two congruent disks (Q5918557) (← links)
• Intersecting disks using two congruent disks (Q5918623) (← links)
• Intersecting disks using two congruent disks (Q5925580) (← links)
• Covering convex polygons by two congruent disks (Q5970791) (← links)
• An optimal and practical algorithm for the planar 2-center problem (Q6636068) (← links)