Pages that link to "Item:Q3546291"
From MaRDI portal
The following pages link to Asymmetric <i>k</i> -center is log <sup>*</sup> <i>n</i> -hard to approximate (Q3546291):
Displaying 7 items.
- A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
- Matroid and knapsack center problems (Q300451) (← links)
- The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
- Approximability of packing disjoint cycles (Q534781) (← links)
- (Q5009501) (← links)
- Approximating Distance Measures for the Skyline (Q5091120) (← links)
- (Q6062155) (← links)
