Pages that link to "Item:Q5945923"

The following pages link to Approximation of geometric dispersion problems (Q5945923):

Displaying 17 items.

• Minimum covering with travel cost (Q454247) (← links)
• Dispersion in disks (Q693055) (← links)
• Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537) (← links)
• Connecting a set of circles with minimum sum of radii (Q1699280) (← links)
• Dispersing points on intervals (Q1706121) (← links)
• Discrete representation of non-dominated sets in multi-objective linear programming (Q1751259) (← links)
• A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
• Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
• Repulsion-based p-dispersion with distance constraints in non-convex polygons (Q2070713) (← links)
• Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
• Systems of distant representatives in Euclidean space (Q2347967) (← links)
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
• Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
• AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS (Q4650086) (← links)
• TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING (Q4682152) (← links)
• A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM (Q5322316) (← links)
• The dispersive art gallery problem (Q6092310) (← links)