Pages that link to "Item:Q2015790"

The following pages link to An approximation algorithm for \(k\)-center problem on a convex polygon (Q2015790):

Displaying 7 items.

• The connected disk covering problem (Q1702836) (← links)
• Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
• The polygon burning problem (Q2154090) (← links)
• Efficient algorithms for computing one or two discrete centers hitting a set of line segments (Q2424732) (← links)
• The Euclidean \(k\)-supplier problem in \(I R^2\) (Q2661589) (← links)
• Constrained k-Center Problem on a Convex Polygon (Q5859739) (← links)
• Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)