Pages that link to "Item:Q2412430"

The following pages link to Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem (Q2412430):

Displaying 8 items.

• A faster algorithm for the two-center decision problem (Q685492) (← links)
• A near-linear algorithm for the planar 2-center problem (Q1364134) (← links)
• Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← 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)
• On the planar two-center problem and circular hulls (Q2105328) (← links)
• Efficient planar two-center algorithms (Q2230394) (← links)
• Discrete and mixed two-center problems for line segments (Q6121433) (← links)