Pages that link to "Item:Q2118113"
From MaRDI portal
The following pages link to A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113):
Displaying 6 items.
- Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
- Computing and Combinatorics (Q4681195) (← links)
- (Q5136270) (← links)
- An approximation algorithm for diversity-aware fair \(k\)-supplier problem (Q6144023) (← links)