Pages that link to "Item:Q436692"

The following pages link to Base station placement on boundary of a convex polygon (Q436692):

Displaying 8 items.

• An incremental version of the \(k\)-center problem on boundary of a convex polygon (Q887897) (← links)
• Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
• Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
• An approximation algorithm for \(k\)-center problem on a convex polygon (Q2015790) (← links)
• The discrete and mixed minimax 2-center problems (Q2424880) (← links)
• The Euclidean \(k\)-supplier problem in \(I R^2\) (Q2661589) (← links)
• THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
• The Discrete and Mixed Minimax 2-Center Problem (Q3467837) (← links)