Pages that link to "Item:Q2230394"
From MaRDI portal
The following pages link to Efficient planar two-center algorithms (Q2230394):
Displaying 22 items.
- A faster algorithm for the two-center decision problem (Q685492) (← links)
- The discrete 2-center problem (Q1272957) (← links)
- A sweepline algorithm to solve the two-center problem (Q1318733) (← links)
- A near-linear algorithm for the planar 2-center problem (Q1364134) (← links)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
- More planar two-center algorithms (Q1961384) (← links)
- A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem (Q1969591) (← links)
- Discrete rectilinear 2-center problems (Q1975961) (← links)
- An efficient algorithm for the proximity connected two center problem (Q2169955) (← links)
- On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
- Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem (Q2412430) (← links)
- The discrete and mixed minimax 2-center problems (Q2424880) (← links)
- The 2-center problem with obstacles (Q2777608) (← links)
- Constrained square-center problems (Q5054846) (← links)
- The two-line center problem from a polar view: a new algorithm and data structure (Q5057418) (← links)
- Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model (Q5379895) (← links)
- Maximizing the Sum of Radii of Disjoint Balls or Disks (Q5745395) (← 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)
