Pages that link to "Item:Q1944391"

The following pages link to Some variations on constrained minimum enclosing circle problem (Q1944391):

Displaying 16 items.

• Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
• Computing the center of uncertain points on tree networks (Q527423) (← links)
• The connected disk covering problem (Q1702836) (← links)
• The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
• The Euclidean \(k\)-supplier problem in \(I R^2\) (Q2661589) (← links)
• The coverage problem by aligned disks (Q2695288) (← links)
• Linear-Time Fitting of a k-Step Function (Q2795937) (← links)
• Computing the Line-Constrained k-center in the Plane for Small k (Q2830071) (← links)
• Geometric p-Center Problems with Centers Constrained to Two Lines (Q2958084) (← links)
• Computing the Rectilinear Center of Uncertain Points in the Plane (Q4557735) (← links)
• An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
• An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
• Constrained k-Center Problem on a Convex Polygon (Q5859739) (← links)
• Algorithms for the line-constrained disk coverage and related problems (Q5896893) (← links)
• Algorithms for the line-constrained disk coverage and related problems (Q5918695) (← links)
• The Coverage Problem by Aligned Disks (Q6173214) (← links)