Pages that link to "Item:Q3546291"

The following pages link to Asymmetric <i>k</i> -center is log ^* <i>n</i> -hard to approximate (Q3546291):

Displaying 5 items.

• A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
• Matroid and knapsack center problems (Q300451) (← links)
• (Q5009501) (← links)
• Approximating Distance Measures for the Skyline (Q5091120) (← links)
• (Q6062155) (← links)