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 15 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)
- On perturbation resilience of non-uniform \(k\)-center (Q2072096) (← links)
- The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
- Client assignment problems for latency minimization (Q2424655) (← links)
- Discrete sensor placement problems in distribution networks (Q2489111) (← links)
- Asymmetry in \(k\)-center variants (Q2503348) (← links)
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem (Q4216137) (← links)
- (Q4875162) (← links)
- (Q5009501) (← links)
- Approximating Distance Measures for the Skyline (Q5091120) (← links)
- Approximability of Packing Disjoint Cycles (Q5387766) (← links)
- (Q6062155) (← links)