The following pages link to (Q4875162):
Displaying 8 items.
- Approximation algorithms for Hamming clustering problems (Q876719) (← links)
- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs (Q2185812) (← links)
- Asymmetric \(k\)-center with minimum coverage (Q2380063) (← links)
- Asymmetry in \(k\)-center variants (Q2503348) (← links)
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem (Q4216137) (← links)
- Facility location with dynamic distance functions (Q5054838) (← links)
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives (Q6053591) (← links)
